Adjoint equivalent graphs about a certain type of 3-ary trees

zbMATH Open1155.05326MaRDI QIDQ5456428FDOQ5456428

Authors: Bo Wang 

Publication date: 4 April 2008

Recommendations

• On the roots of adjoint polynomials of some graphs
• Publication:4885061
• scientific article; zbMATH DE number 1766900
• The chromatically equivalence theorem of three kinds of combinatorial graphs
• scientific article; zbMATH DE number 1744094

zbMATH Keywords

graphadjoint equivalent3-ary tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Adjoint equivalent graphs about a certain type of \(3\)-ary trees

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