Determinants of adjacency matrices of graphs
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices. Using Brendan McKay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2012-12-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=2041&_ob=dfea7756845067696c4a750520b02fe7&fileName=full_text.pdf. |
id |
doaj-aa5e0b9f855e40808c469b4e403fc01f |
---|---|
record_format |
Article |
spelling |
doaj-aa5e0b9f855e40808c469b4e403fc01f2020-11-24T22:38:23ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652012-12-0114916Determinants of adjacency matrices of graphsAlireza AbdollahiWe study the set of all determinants of adjacency matrices of graphs with a given number of vertices. Using Brendan McKay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. Using an idea of M. Newman, it is proved that if $G$ is a graph with $n$ vertices and ${d_1,dots,d_n}$ is the set of vertex degrees of $G$, then $gcd(2m,d^2)$ divides the determinant of the adjacency matrix of $G$, where $d=gcd(d_1,dots,d_n)$. Possible determinants of adjacency matrices of graphs with exactly two cycles are obtained.http://www.combinatorics.ir/?_action=showPDF&article=2041&_ob=dfea7756845067696c4a750520b02fe7&fileName=full_text.pdf.Determinantadjacency matrices of graphsmaximum determinant |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Alireza Abdollahi |
spellingShingle |
Alireza Abdollahi Determinants of adjacency matrices of graphs Transactions on Combinatorics Determinant adjacency matrices of graphs maximum determinant |
author_facet |
Alireza Abdollahi |
author_sort |
Alireza Abdollahi |
title |
Determinants of adjacency matrices of graphs |
title_short |
Determinants of adjacency matrices of graphs |
title_full |
Determinants of adjacency matrices of graphs |
title_fullStr |
Determinants of adjacency matrices of graphs |
title_full_unstemmed |
Determinants of adjacency matrices of graphs |
title_sort |
determinants of adjacency matrices of graphs |
publisher |
University of Isfahan |
series |
Transactions on Combinatorics |
issn |
2251-8657 2251-8665 |
publishDate |
2012-12-01 |
description |
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices. Using Brendan McKay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. Using an idea of M. Newman, it is proved that if $G$ is a graph with $n$ vertices and ${d_1,dots,d_n}$ is the set of vertex degrees of $G$, then $gcd(2m,d^2)$ divides the determinant of the adjacency matrix of $G$, where $d=gcd(d_1,dots,d_n)$. Possible determinants of adjacency matrices of graphs with exactly two cycles are obtained. |
topic |
Determinant adjacency matrices of graphs maximum determinant |
url |
http://www.combinatorics.ir/?_action=showPDF&article=2041&_ob=dfea7756845067696c4a750520b02fe7&fileName=full_text.pdf. |
work_keys_str_mv |
AT alirezaabdollahi determinantsofadjacencymatricesofgraphs |
_version_ |
1725713305934233600 |