scientific article; zbMATH DE number 1744094

MaRDI QIDQ4529518zbMATH OpenFDO

Authors C. H. C. Little, F. M. Dong, K. L. Teo, M. D. Hendy

Publication date 20 September 2002

zbMATH Keywords

adjoint polynomialsadjointly equivalent graphschromatic polynomialschromatically equivalent graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Duality of graph invariants
• Invariant adjacency matrices of configuration graphs
• scientific article; zbMATH DE number 4139784
• On problems and conjectures on adjointly equivalent graphs
• Invariants of E-graphs
• INVARIANTS OF GRAPHS
• scientific article; zbMATH DE number 6750083
• scientific article; zbMATH DE number 4132214
• The odd-even invariant for graphs
• On invariant graph subspaces

Cited in

(7)

• One more remark on the adjoint polynomial
• A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2
• scientific article; zbMATH DE number 437501 (Why is no real title available?)
• Adjoint equivalent graphs about a certain type of 3-ary trees
• On problems and conjectures on adjointly equivalent graphs
• The adjoint polynomial of compound graphs
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529518)