On matching number, decomposition and rep resentation of well-formed graph

被引：0

作者：

Nieva, Alex Ralph B. ^{[1
]}

Nocum, Karen P. ^{[2
]}

机构：

[1] Camarines Polytech Coll, Nabua, Camarines Sur, Philippines

[2] Batangas State Univ, Natl Engn Univ, Batangas, Philippines

来源：

ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2023年 / 11卷 / 02期

关键词：

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

D O I：

10.5614/ejgta.2023.11.2.13

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：501 / 510

页数：10