On some properties of Non-traceable Cubic Bridge Graph

被引：1

作者：

Nieva, Alex Ralph Baisa ^{[1
]}

Nocum, Karen P. ^{[2
]}

机构：

[1] Fac Camarines Polytech Coll, Coll Arts & Sci, Nabua, Philippines

[2] Fac Batangas State Univ, Coll Arts & Sci, Batangas City, Philippines

来源：

EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2022年 / 15卷 / 04期

关键词：

Cubic graph; bridge graph; non-traceable; central fragment; NTCBG;

D O I：

10.29020/nybg.ejpam.v15i4.4453

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Graphs considered in this paper are simple finite undirected graph without loops or multiple edges. A simple graph where each vertex has degree 3 is called a cubic graph. A cubic graph, that is, 1-connected or cubic bridge graph is traceable if it contains a Hamiltonian path. Otherwise, we called it non-traceable. In this paper, we introduce a new family of cubic graphs called Non-Traceable Cubic Bridge Graph (NTCBG) that satisfies the conjecture of Zoeram and Yaqubi (2017). In addition, we define two important connected components of NTCBG those are the central fragment that gives assurance for a graph to be non-traceable and its branch. Some properties of a NTCBG such as chromatic number and clique number are also provided.

引用

页码：1536 / 1548

页数：13