On Some Properties of Non-traceable Cubic Bridge Graph

Authors

  • Alex Ralph Nieva Pamantasan Ng Lungsod Ng Manila
  • Karen P. Nocum

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i4.4453

Keywords:

cubic graph, bridge graph, non-traceable, central fragment, NTCBG

Abstract

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

Downloads

How to Cite

Nieva, A. R., & Nocum, K. P. . (2022). On Some Properties of Non-traceable Cubic Bridge Graph. European Journal of Pure and Applied Mathematics, 15(4), 1536–1548. https://doi.org/10.29020/nybg.ejpam.v15i4.4453