当前位置: X-MOL 学术Inf. Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A characterization of 3-γ-critical graphs which are not bicritical
Information Processing Letters ( IF 0.5 ) Pub Date : 2020-10-27 , DOI: 10.1016/j.ipl.2020.106062
Jie Chen , Shou-Jun Xu

A subset S of vertices in a graph G with vertex set V and edge set E is a dominating set of G if every vertex of VS is adjacent to a vertex in S. The minimum cardinality of a dominating set is the dominating number γ(G) of G. G is a 3-γ-critical graph if γ(G)=3 and γ(G+e)2 for eE; G is bicritical if Guv contains a perfect matching for every pair of distinct vertices u,vV. In this paper, we characterize 3-connected 3-γ-critical graphs G of even order which are not bicritical: two classes of graphs, which generalizes the result: if the minimum degree of G is at least 4, then G is bicritical N. Ananchuen and M.D. Plummer (2014) [2].



中文翻译:

非双临界的3- γ临界图的特征

一个子集小号在图中的顶点的ģ与顶点组V和边缘集Ë是一个控制集ģ如果每个顶点的V小号S中的顶点相邻。支配集的最小基数是支配数 γGģ。如果是,则G是一个3 -γ临界γG=3γG+Ë2 对于 ËË; 如果G双临界的G-ü-v 包含每对不同顶点的完美匹配 üvV。在本文中,我们刻画了非双临界的偶数阶3连通3- γ临界图G:两类图,将结果概括如下:如果G的最小度至少为4,则G为双临界N Ananchuen和MD Plummer(2014)[2]。

更新日期:2020-12-04
down
wechat
bug