The characteristic polynomial of a graph

DOI10.1016/0095-8956(72)90023-8zbMath0212.29401OpenAlexW2037847080WikidataQ97007970 ScholiaQ97007970MaRDI QIDQ2544589

Abbe Mowshowitz

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90023-8

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (35)

Spectra of weighted uniform hypertrees ⋮ Maximal determinants of combinatorial matrices ⋮ Novel results on partial Hosoya polynomials: an application in chemistry ⋮ Laplacian spectra and spanning trees of threshold graphs ⋮ The spectra of uniform hypertrees ⋮ Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph ⋮ A note on cospectral graphs ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ Unnamed Item ⋮ On 4-Sachs optimal graphs ⋮ On the coefficients of skew Laplacian characteristic polynomial of digraphs ⋮ Complementarity eigenvalue analysis of connected graphs ⋮ Minimum vertex covers and the spectrum of the normalized Laplacian on trees ⋮ Permanental polynomials of graphs ⋮ Tree counting polynomials for labelled graphs. I: Properties ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ A large family of cospectral Cayley graphs over dicyclic groups ⋮ Growth rates of geometric grid classes of permutations ⋮ A large family of cospectral Cayley graphs over dihedral groups ⋮ Spectra, Euclidean representations and clusterings of hypergraphs ⋮ Spectra of digraphs ⋮ Eigenvalues of a graph and its imbeddings ⋮ On the distance matrix of a tree ⋮ An introduction to matching polynomials ⋮ Spectra of Cayley graphs ⋮ On roots of Wiener polynomials of trees ⋮ On the roots of Wiener polynomials of graphs ⋮ Nonisomorphic trees with the same T-polynomial ⋮ Distance matrix polynomials of trees ⋮ On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs ⋮ On conjectures of network distance measures by using graph spectra ⋮ A note on non-isomorphic cospectral digraphs ⋮ Cospectral graphs and digraphs with given automorphism group ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ On bipartite graphs having minimum fourth adjacency coefficient

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• The Determinant of the Adjacency Matrix of a Graph
• On the Line Graph of a Symmetric Balanced Incomplete Block Design
• Cospectral Graphs and Digraphs

This page was built for publication: The characteristic polynomial of a graph