A complete solution to the chromatic equivalence class of graph ^1_n

MaRDI QIDQ2906259zbMATH OpenFDO

Authors Yaping Mao, Chengfu Ye

Publication date 5 September 2012

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

adjoint polynomialchromatic equivalence classthe smallest real rootthe fifth character

Mathematics Subject Classification ID

Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• The chromatic equivalence class of graph \(\psi_n^3(n-3,1)\).
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
• The chromatic equivalence class of graph B_n-6,12
• The fifth coefficient of adjoint polynomial and a new invariant.

Cited in

(6)

• A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• The chromatic equivalence class of graph B_n-6,12
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs
• The chromatic equivalence class of graph \(\psi_n^3(n-3,1)\).
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)

This page was built for publication: A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\)

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