On problems and conjectures on adjointly equivalent graphs (Q556853): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The authors solve the problem of \textit{F. M. Dong, K. L. Teo, C. H. C. Little} and \textit{M. D. Hendy} [Discrete Math. 258, 303--321 (2002; Zbl 1010.05024)] to determine adjoint closures of two special classes of graphs, and consequently, disprove their conjectures. They also give necessary and sufficient conditions for two graphs to be adjointly equivalent, provided both graphs have their minimum real root of adjoint polynomial larger than or equal to \(-4\). | |||
Property / review text: The authors solve the problem of \textit{F. M. Dong, K. L. Teo, C. H. C. Little} and \textit{M. D. Hendy} [Discrete Math. 258, 303--321 (2002; Zbl 1010.05024)] to determine adjoint closures of two special classes of graphs, and consequently, disprove their conjectures. They also give necessary and sufficient conditions for two graphs to be adjointly equivalent, provided both graphs have their minimum real root of adjoint polynomial larger than or equal to \(-4\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dragan Stevanović / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C75 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 2181970 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic polynomial | |||
Property / zbMATH Keywords: chromatic polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adjoint polynomial | |||
Property / zbMATH Keywords: adjoint polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adjoint closure | |||
Property / zbMATH Keywords: adjoint closure / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adjoint equivalence | |||
Property / zbMATH Keywords: adjoint equivalence / rank | |||
Normal rank |
Revision as of 13:55, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On problems and conjectures on adjointly equivalent graphs |
scientific article |
Statements
On problems and conjectures on adjointly equivalent graphs (English)
0 references
23 June 2005
0 references
The authors solve the problem of \textit{F. M. Dong, K. L. Teo, C. H. C. Little} and \textit{M. D. Hendy} [Discrete Math. 258, 303--321 (2002; Zbl 1010.05024)] to determine adjoint closures of two special classes of graphs, and consequently, disprove their conjectures. They also give necessary and sufficient conditions for two graphs to be adjointly equivalent, provided both graphs have their minimum real root of adjoint polynomial larger than or equal to \(-4\).
0 references
chromatic polynomial
0 references
adjoint polynomial
0 references
adjoint closure
0 references
adjoint equivalence
0 references