Characterizing Block Graphs in Terms of One-vertex Extensions
DOI:
https://doi.org/10.5540/tema.2019.020.02.323Keywords:
block graph, one-vertex-extensionAbstract
Block graphs has been extensively studied for many decades. In this paper we present a new characterization of the class in terms of one-vertex extensions. To this purpose, a specific representation based on the concept of boundary cliques is presented, bringing about some properties of the graph.
References
F. Harary, “A characterization of block graphs,” Canadian Mathematical Bul- letin, vol. 6, no. 1, pp. 1–6, 1963.
E. Howorka, “On metric properties of certain clique graphs,” Journal of Com- binatorial Theory, Series B, vol. 27, pp. 67–74, 1979.
H.-J. Bandelt and H. M. Mulder, “Three interval conditions for graphs,” Ars Combinatoria, vol. 29B, pp. 213–223, 1990.
A. Behtoei, M. Jannesari, and B. Taeri, “A characterization of block graphs,” Discrete Applied Mathematics, vol. 158, pp. 219–221, 2010.
H.-J. Bandelt and H. M. Mulder, “Distance-hereditary graphs,” Journal of Combinatorial Theory, Series B, vol. 41, pp. 182–208, 1986.
H. Mulder and L. Nebeský, “Leaps: an approach to the block structure of a graph,” Discussiones Mathematicae Graph Theory, vol. 26, pp. 77–90, 2006.
A. Dress, K. Huber, J. Koolen, V. Moulton, and A. Spillner, “Characterizing block graphs in terms of their vertex-induced partitions,” Australasian Journal of Combinatorics, vol. 66, no. 1, pp. 1–9, 2016.
H. Mulder, “An observation on block graphs,” Bulletin of the Institute of Com- binatorics and its Applications, vol. 77, pp. 57–58, 2016.
J. R. S. Blair and B. Peyton, “An introduction to chordal graphs and clique trees,” In Graph Theory and Sparse Matrix Computation, IMA, vol. 56, pp. 1– 29, 1993.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 2 ed., 2004.
L. Markenzon, P. R. C. Pereira, C. F. E. M. Waga, C. V. P. Friedmann, and A. Lozano, “An efficient representation of chordal graphs,” Operations Research Letters, vol. 41, pp. 331–335, 2013.
D. J. Rose, R. E. Tarjan, and G. Lueker, “Algorithmic aspects of vertex elimination on graphs,” SIAM Journal on Computing, vol. 5, pp. 266–283, 1976.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.
