arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.08368math.CO
收藏

全$k$ -一致图

Total $k$-Uniform Graphs

Selim Bahadır, Didem Gözüpek, Oğuz Doğan

摘要:

图$G$中的一个顶点序列称为全控制序列,如果序列中的每个顶点$v$都有一个邻点不与序列中的$v$之前的顶点相邻,并且在序列的末尾,$G$的每个顶点至少有一个邻点.全控制序列的最小和最大长度分别是$G$的全控制数(用$γ_t(G)$表示)和$G$的Grundy全控制数(用$γ_{gr}^t(G)$表示)。本文研究了具有相等全控制数和Grundy全控制数的图。对于每一个正整数$k$,如果$γ_t(G)=γ_{gr}^t(G)=k$,则称$G$为全$k$ -一致图.证明了当$k$为奇数时,不存在全$k$ -一致图.此外,我们还提出了一个全4-一致图,它是T. Gologranc等人的研究,并给出了一个连通全8-一致图.此外,我们还证明了对于每个偶图$k$,每个全$k$ -均匀连通无伪孪生图都是正则的.证明了不存在具有$k\geq 4$的全$k$ -一致弦连通图,并刻画了全$k$ -一致弦连通图.

英文摘要:

A sequence of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v$ in the sequence has a neighbor which is adjacent to no vertex preceding $v$ in the sequence, and at the end every vertex of $G$ has at least one neighbor in the sequence. Minimum and maximum lengths of a total dominating sequence is the total domination number of $G$ (denoted by $γ_t(G)$) and the Grundy total domination number of $G$ (denoted by $γ_{gr}^t(G)$), respectively. In this paper, we study graphs with equal total domination number and Grundy total domination number. For every positive integer $k$, we call $G$ a total $k$-uniform graph if $γ_t(G)=γ_{gr}^t(G)=k$. We prove that there is no total $k$-uniform graph when $k$ is odd. In addition, we present a total 4-uniform graph which stands as a counterexample for a conjecture by T. Gologranc et.al. and provide a connected total 8-uniform graph. Moreover, we prove that every total $k$-uniform, connected and false twin-free graph is regular for every even $k$. We also show that there is no total $k$-uniform chordal connected graph with $k\geq 4$ and characterize all total $k$-uniform chordal graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑