Leaps: an approach to the block structure of a graph
Henry Martyn Mulder ; Ladislav Nebeský
Discussiones Mathematicae Graph Theory, Tome 26 (2006), p. 77-90 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

To study the block structure of a connected graph G = (V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V. These algebraic structures are easily studied by considering their underlying graphs, which turn out to be block graphs. Conversely, we define the operation +G as well as the set of leaps LG of the connected graph G. The underlying graph of +G, as well as that of LG, turns out to be just the block closure of G (i.e., the graph obtained by making each block of G into a complete subgraph).

Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:270237 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1303,
     author = {Henry Martyn Mulder and Ladislav Nebesk\'y},
     title = {Leaps: an approach to the block structure of a graph},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {26},
     year = {2006},
     pages = {77-90},
     zbl = {1106.05093},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1303}
}

Henry Martyn Mulder; Ladislav Nebeský. Leaps: an approach to the block structure of a graph. Discussiones Mathematicae Graph Theory, Tome 26 (2006) pp. 77-90. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1303/

[000] [1] M. Changat, S. Klavžar and H.M. Mulder, The all-path transit function of a graph, Czechoslovak Math. J. 51 (2001) 439-448, doi: 10.1023/A:1013715518448. | Zbl 0977.05135

[001] [2] F. Harary, A characterization of block graphs, Canad. Math. Bull. 6 (1963) 1-6, doi: 10.4153/CMB-1963-001-x. | Zbl 0112.25002

[002] [3] F. Harary, Graph Theory (Addison-Wesley, Reading MA, 1969).

[003] [4] M.A. Morgana and H.M. Mulder, The induced path convexity, betweenness, and svelte graphs, Discrete Math. 254 (2002) 349-370, doi: 10.1016/S0012-365X(01)00296-5. | Zbl 1003.05090

[004] [5] H.M. Mulder, The interval function of a graph (MC-tract 132, Mathematish Centrum, Amsterdam 1980).

[005] [6] H.M. Mulder, Transit functions on graphs, in preparation. | Zbl 1166.05019

[006] [7] L. Nebeský, A characterization of the interval function of a graph, Czechoslovak Math. J. 44 (119) (1994) 173-178. | Zbl 0808.05046

[007] [8] L. Nebeský, Geodesics and steps in a connected graph, Czechoslovak Math. J. 47 (122) (1997) 149-161. | Zbl 0898.05041

[008] [9] L. Nebeský, An algebraic characterization of geodetic graphs, Czechoslovak Math. J. 48 (123) (1998) 701-710. | Zbl 0949.05022

[009] [10] L. Nebeský, A tree as a finite nonempty set with a binary operation, Mathematica Bohemica 125 (2000) 455-458. | Zbl 0963.05032

[010] [11] L. Nebeský, New proof of a characterization of geodetic graphs, Czechoslovak Math. J. 52 (127) (2002) 33-39. | Zbl 0995.05124