错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Laplacian Spectrum of Two Classes of \(\psi \)-Sum Graphs with Applications

  • Yanru Zhuo,
  • Shuming Zhou,
  • Lulu Yang

摘要

Graph operation is an effective way to synthetize several kinds of big graphs from small factor graphs. Subdivided graph ( \(\text {S}(\Gamma )\) S ( Γ ) ) is a graph obtained by adding a vertex to each edge of graph \(\Gamma \) Γ , while vertex-semi total graph ( \(R(\Gamma )\) R ( Γ ) ) is the graph obtained by adding a new vertex corresponding to each edge of graph \(\Gamma \) Γ and joining the new vertex to the end vertices of the corresponding edge. Subdivided sum graph and vertex-semi total sum graph are two kinds of \(\psi \) ψ -sum graphs generated by utilizing Cartesian product operation for \(\psi (\Gamma _1)\) ψ ( Γ 1 ) and \(\Gamma _2\) Γ 2 , denoted by \(\Gamma _1+_{\psi }\Gamma _2\) Γ 1 + ψ Γ 2 , where \(\psi \in \{S, R\}\) ψ { S , R } . In this work, we establish the Laplacian spectrum of \(\Gamma _1+_S\Gamma _2\) Γ 1 + S Γ 2 and \(\Gamma _1+_R\Gamma _2\) Γ 1 + R Γ 2 of k-regular graph \(\Gamma _1\) Γ 1 and any connected graph \(\Gamma _2\) Γ 2 in terms of Laplacian spectrum of factor graphs. As applications, we determine the Kirchhoff index, global mean-first passage time and number of spanning trees of \(\Gamma _1+_S\Gamma _2\) Γ 1 + S Γ 2 and \(\Gamma _1+_R\Gamma _2\) Γ 1 + R Γ 2 , respectively.