On problems and conjectures on adjointly equivalent graphs (Q556853): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.02.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027736683 / rank | |||
Normal rank | |||
Revision as of 21:56, 19 March 2024
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
