Block graph of a graph
Автор: Kelkar Ashwini, Jaysurya K., Nagesh Hadonahalli M.
Журнал: Владикавказский математический журнал @vmj-ru
Статья в выпуске: 1 т.21, 2019 года.
Бесплатный доступ
The block graph of a graph G, written B(G), is the graph whose vertices are the blocks of G and in which two vertices are adjacent whenever the corresponding blocks have a cut-vertex in common. We study the properties of B(G) and present the characterization of graphs whose B(G) are planar, outerplanar, maximal outerplanar, minimally non-outerplanar, Eulerian, and Hamiltonian. A necessary and sufficient condition for B(G) to have crossing number one is also presented.
Rossing number, inner vertex number, dutch windmill graph, complete graph
Короткий адрес: https://sciup.org/143168792
IDR: 143168792 | DOI: 10.23671/VNC.2019.1.27736
Список литературы Block graph of a graph
- Harary, F. Graph Theory, Reading, Addison Wesley, 1969.
- Harary, F. A Characterization of Block-Graphs, Canadian Mathematical Bulletin, 1963, vol. 6, issue 1, pp. 1-6 DOI: 10.4153/CMB-1963-001-x
- Kulli, V. R. On Minimally Nonouterplanar Graphs, Proceeding of the Indian National Science Academy, 1975, vol. 40, pp. 276-280.
