On problems and conjectures on adjointly equivalent graphs (Q556853)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On problems and conjectures on adjointly equivalent graphs |
scientific article; zbMATH DE number 2181970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On problems and conjectures on adjointly equivalent graphs |
scientific article; zbMATH DE number 2181970 |
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
0.9018133
0 references
0.9003689
0 references
0.8999636
0 references
0.89782566
0 references
