四次循环图的空度及其极值空空间
On the nullities of quartic circulant graphs and their extremal null spaces
AI总结:
本文研究四次循环图的空度及其极值空空间,推导出计算空度的公式并确定其极值特性。
摘要:
循环图是一种简单图,其邻接矩阵可以表示为循环矩阵的形式,而nut图则被认为是其空空间由一个完整的向量张成的图。在Damnjanović之前的研究所确定的完整集合中,所有存在d-正则循环nut图的(n, d)对都已确定。受上述结果的启发,我们专注于四次循环图,并推导出计算其空度的显式公式。此外,我们实现了上述公式,以获得检查特定四次循环图奇异性的方法,并找到用于测试此类图是否为nut图的简洁标准。随后,我们计算了固定阶数n的四次循环图所能达到的最小和最大空度,对于每个可行的阶数n≥5。最后,我们确定了达到这些空度的所有图,并为所有相应极值空空间提供完整刻画。
英文摘要:
A circulant graph is a simple graph whose adjacency matrix can be represented in the form of a circulant matrix, while a nut graph is considered to be a graph whose null space is spanned by a single full vector. In a previous study by Damnjanović [arXiv:2212.03026, 2022], the complete set of all the pairs $(n, d)$ for which there exists a $d$-regular circulant nut graph of order $n$ has been determined. Motivated by the said results, we put our focus on the quartic circulant graphs and derive an explicit formula for computing their nullities. Furthermore, we implement the aforementioned formula in order to obtain a method for inspecting the singularity of a particular quartic circulant graph and find the concise criteria to be used for testing whether such a graph is a nut graph. Subsequently, we compute the minimum and maximum nullity that a quartic circulant graph of a fixed order $n$ can attain, for each viable order $n \ge 5$. Finally, we determine all the graphs attaining these nullities and then provide a full characterization of all of their corresponding extremal null spaces.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。