The characteristic polynomial of a graph

DOI10.1016/0095-8956(72)90023-8zbMATH Open0212.29401OpenAlexW2037847080WikidataQ97007970 ScholiaQ97007970MaRDI QIDQ2544589FDOQ2544589

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Spektren endlicher Grafen
• The Determinant of the Adjacency Matrix of a Graph
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Cospectral Graphs and Digraphs
• Title not available (Why is that?)
• On the Line Graph of a Symmetric Balanced Incomplete Block Design

Cited In (36)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544589)