Harmonious chromatic number of central graph of complete graph families

MaRDI QIDQ6566340zbMATH OpenFDO

Authors Ali M. Akbar, Vivin J. Vernold

Publication date 3 July 2024

Published in Journal of Combinatorics, Information \& System Sciences (Search for Journal in Brave)

zbMATH Keywords

central graphharmonious colouringline graphmiddle graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5856652
• ON HARMONIOUS CHROMATIC NUMBER OF C(Tm,n), M(Tm,n), C(L(Tm,n) AND M(L(Tm,n))
• On harmonious colouring of central graphs
• On harmonious colouring of line graph of central graphs of bipartite graphs
• On harmonious colouring of line graph of central graphs of bipartite graphs

Cited in

(4)

• ON HARMONIOUS CHROMATIC NUMBER OF C(Tm,n), M(Tm,n), C(L(Tm,n) AND M(L(Tm,n))
• On harmonious colouring of line graph of central graphs of bipartite graphs
• Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation
• On the differential in central operator \(\mathcal{C} (G)\)

This page was built for publication: Harmonious chromatic number of central graph of complete graph families

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