A note on Hoffman-type identities of graphs (Q556886): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A table of connected graphs on six vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2785496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of walks in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hoffman-type identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some results on graph spectra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Polynomial of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arithmetical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Hoffman number of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Main eigenvalues of a graph / rank | |||
Normal rank |
Latest revision as of 11:49, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on Hoffman-type identities of graphs |
scientific article |
Statements
A note on Hoffman-type identities of graphs (English)
0 references
23 June 2005
0 references
\textit{A. J. Hoffman} [Am. Math. Mon. 70, 30--36 (1963; Zbl 0112.14901)] gave a matrix polynomial in the adjacency matrix of a graph which satisfies a certain identity if and only if the graph is regular. \textit{A. Dress} and the reviewer in [Appl. Math. Lett. 16, 297--302 (2003; Zbl 1041.05048)] extended these results to characterize harmonic and semiharmonic graphs. The present authors further generalize these results by rephrasing the matrix polynomial in terms of the main eigenvalues of a graph and providing the identity satisfied for graphs with up to three main eigenvalues. They also provide a new Hoffman-type identity for arithmetical graphs.
0 references
Hoffman polynomial
0 references
Hoffman identity
0 references
main eigenvalue
0 references
arithmetical graph
0 references