On matching number, decomposition and representation of well-formed graph
| Main Authors: | Nieva, Alex Ralph Baisa; Camarines Sur Polytechnic Colleges, Nocum, Karen P.; Batangas State University The National Engineering University, Philippines |
|---|---|
| Other Authors: | DOST-SEI |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2023
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1799 https://www.ejgta.org/index.php/ejgta/article/view/1799/pdf_284 |
Daftar Isi:
- 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.