The path graph of the amalgamated graph of C3 and Cn at an edge or at a vertex

被引：0

作者：

Hussein, Eman ^{[1
]}

Al-Ezeh, Hasan ^{[1
]}

Abu Ghneim, Omar ^{[1
]}

机构：

[1] Univ Jordan, Fuculty Sci, Dept Math, Amman, Jordan

来源：

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2020年 / 43期

关键词：

path graphs; amalgamated graph; independence number; domination number; matching number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Path graphs were proposed as a generalization of line graphs. The 2-path graph denoted by P-2(G), of a graph G has vertex set the set of all paths of length two. Two such vertices are adjacent in the new graph if their union is a path of length three or a cycle of length three. In this paper we will introduce the path graph of the amalgamated graph of C-3 and C-n at an edge and at a vertex. Also, some new properties of these graphs will be given such as the independence number, domination number and matching number.

引用

页码：492 / 502

页数：11

共 9 条

[1]

Aldred REL, 1997, J GRAPH THEOR, V26, P35, DOI 10.1002/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO

[2]

2-I

[3]

Belan A., 1999, J ACTA MATH U COMENI, VLXV, P111

[4] PATH GRAPHS [J].