Hoffman-type identities (Q1431929): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the Polynomial of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2785496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of standard and of effective multiple alignments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semiharmonic trees and monocyclic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic results regarding the number of walks in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Harmonic trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Polynomial of a Directed Graph / rank | |||
Normal rank |
Revision as of 16:51, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hoffman-type identities |
scientific article |
Statements
Hoffman-type identities (English)
0 references
11 June 2004
0 references
Let \(G\) be a simple graph and let \(A\) be the adjacency matrix of \(G\). Hoffman observed that \(G\) is a connected regular graph if and only if there exists a polynomial \(P(x)\) such that \(P(A) = J\), where \(J\) is the \(n\times n\) all-one matrix. In this work the authors generalize the Hoffman identity and derive corresponding identities for the recently introduced classes of harmonic and semiharmonic graphs.
0 references
Hoffman's identity
0 references
regular graphs
0 references
harmonic graphs
0 references
semiharmonic graphs
0 references
adjacency matrix
0 references