当前位置: 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

We say that G has the property P if GN[v] is a cycle for any vertex vV(G), where N[v] is the closed neighborhood of v in G. For an integer l{3,4,5,6}, let Gl be a set of graphs defined as follows:

G3={2K3}{G:both G and G are connected, and G is a triangle-free cubic graph}, where H denotes the complement of H,

G4={L(H):H is a connected triangle-free cubic graph}, where L(H) denotes the line graph of H,

G5={G20}, where G20 is the icosahedron,

G6={G(5,2)}, where G(5,2) is the Petersen graph. Furthermore, let G={G1G2Gt:Gil{3,4,5,6}Gl, t is any positive integer}. We show that a graph G has the property P if and only if GG.



中文翻译:

G  −  N [ v ] 是每个顶点v的循环

我们说G有性质 如果 G-N[v] 是任意顶点的循环 v(G), 在哪里 N[v]是的封闭附近vģ。对于整数{3,4,5,6}, 让 G 是一组定义如下的图:

G3={23}{G两个都 GG 是连接的,并且 G 是无三角形三次图},其中 H表示H的补码,

G4={(H)H 是连通无三角形三次图},其中 (H)表示H的折线图,

G5={G20}, 在哪里 G20 是二十面体,

G6={G(5,2)}, 在哪里 G(5,2)是彼得森图。此外,让G={G1G2GG一世{3,4,5,6}G, t是任何正整数}。我们证明图G具有以下性质 当且仅当 GG.

更新日期:2021-06-22
down
wechat
bug