Sigma chromatic number of the middle graph of some general families of trees of height 2

DOI10.1142/s1793557123501437MaRDI QIDQ6650662

Mark Anthony C. Tolentino, Agnes D. Garciano, Jay-R. A. Manamtam

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

vertex coloringmiddle graphsigma coloringsigma chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The sigma chromatic number of a graph
• Traversability and connectivity of the middle graph of a graph
• The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
• The set chromatic number of a graph
• δ-Dynamic chromatic number of Helm graph families
• On the sigma chromatic number of the join of a finite number of paths and cycles

This page was built for publication: Sigma chromatic number of the middle graph of some general families of trees of height 2