Proof and disproof of conjectures on spectral radii of coclique extension of cycles and paths

S Sun, KC Das - Linear Algebra and its Applications, 2021 - Elsevier
Linear Algebra and its Applications, 2021Elsevier
A coclique extension of a graph H is a graph G obtained from H by replacing each vertex of
H by a coclique, where vertices of G coming from different vertices of H are adjacent if and
only if the original vertices are adjacent in H. Let M n (H) be the set of graphs with order n,
which are the coclique extensions of H. In this paper, we discuss the minimum spectral
radius in M n (P k) and the maximum spectral radius in M n (C k), where P k and C k are the
path of order k and the cycle of order k, respectively. Then we disprove a conjecture on the …
A coclique extension of a graph H is a graph G obtained from H by replacing each vertex of H by a coclique, where vertices of G coming from different vertices of H are adjacent if and only if the original vertices are adjacent in H. Let M n (H) be the set of graphs with order n, which are the coclique extensions of H. In this paper, we discuss the minimum spectral radius in M n (P k) and the maximum spectral radius in M n (C k), where P k and C k are the path of order k and the cycle of order k, respectively. Then we disprove a conjecture on the minimum spectral radius in M n (P k) and confirm a conjecture on the maximum spectral radius in M n (C k), which are given by Monsalve and Rada (2021)[4].
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果