On the total graph of Mycielski graphs, central graphs and their covering numbers
From MaRDI portal
Publication:2860865
DOI10.7151/DMGT.1670zbMath1297.05199OpenAlexW1982125916MaRDI QIDQ2860865
Publication date: 11 November 2013
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1670
independence numberchromatic numberachromatic numbercovering numberMycielski graphtotal graphmiddle graphcentral graphedge covering numberedge independence number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Graph classes generated by Mycielskians ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ A note on total graphs
This page was built for publication: On the total graph of Mycielski graphs, central graphs and their covering numbers