On matching number, decomposition and representation of well-formed graph

Alex Ralph Baisa Nieva, Karen P. Nocum


In this paper, we find a special type of non-traceable cubic bridge graph called well-formed graph whose central fragment is isomorphic to a hairy cycle and whose branches are pairwise isomorphic. We then show that a well-formed graph can be partition into isomorphic subgraph. Some properties of a well-formed graph such as perfect matching, matching number, decomposition and some parameters for pictorial representation are also provided.


cubic graph, non-traceable cubic bridge graph (NTCBG), well-formed graph, hairy cycle

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2023.11.2.13


B. Bollobas, Graduate Texts in Mathematics, Modern Graph Theory.

C. Barrientos, Graceful graphs with pendant edges, Australas. J. Combin. 33 (2005), 99–107.

G. Chartrand, L. Lesniak and P. Zhang, Textbook in Mathematics, Graph and Digraphs, Sixth Edition.

R. Frucht and F. Harary, On the corona of two graphs, Aequationes Math. 4 (1970), 322–325.

A.R. Nieva and K. Nocum, On some properties of Non-traceable Cubic Bridge Graph, Eur. J. Pure Appl. Math. 15 (4) (2022), 1536–1548.

H.G. Zoeram and D. Yaqubi, Spanning k-ended trees of 3-regular connected graph, Electron. J. Graph Theory Appl. 5 (2) (2017), 207–211.


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats