当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Graphs in which G − N[v] is a cycle for each vertex v
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-06-21 , DOI: 10.1016/j.disc.2021.112519 Huijuan Yu , Baoyindureng Wu
中文翻译:
图G − N [ v ] 是每个顶点v的循环
更新日期:2021-06-22
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-06-21 , DOI: 10.1016/j.disc.2021.112519 Huijuan Yu , Baoyindureng Wu
We say that G has the property if is a cycle for any vertex , where is the closed neighborhood of v in G. For an integer , let be a set of graphs defined as follows:
and are connected, and is a triangle-free cubic graph}, where denotes the complement of H,
is a connected triangle-free cubic graph}, where denotes the line graph of H,
, where is the icosahedron,
, where is the Petersen graph. Furthermore, let , t is any positive integer}. We show that a graph G has the property if and only if .
中文翻译:
图G − N [ v ] 是每个顶点v的循环
我们说G有性质 如果 是任意顶点的循环 , 在哪里 是的封闭附近v在ģ。对于整数, 让 是一组定义如下的图:
和 是连接的,并且 是无三角形三次图},其中 表示H的补码,
是连通无三角形三次图},其中 表示H的折线图,
, 在哪里 是二十面体,
, 在哪里 是彼得森图。此外,让, t是任何正整数}。我们证明图G具有以下性质 当且仅当 .