Note on degree Kirchhoff index of graphs
(ندگان)پدیدآور
Hakimi-Nezhaad, MardjanAshrafi, Ali RezaGutman, Ivanنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
The degree Kirchhoff index of a connected graph $G$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $G$. Bounds for the degree Kirchhoff index of the line and para-line graphs are determined. The special case of regular graphs is analyzed.
کلید واژگان
resistance distance (in graphs)Kirchhoff index
degree Kirchhoff index
spectrum of graph
Laplacian spectrum of graph
05C12 Distance in graphs
05C20 Directed graphs (digraphs), tournaments
05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
شماره نشریه
3تاریخ نشر
2013-09-011392-06-10
ناشر
University of Isfahanسازمان پدید آورنده
University of KashanUniversity of Kashan
University of Kragujevac Kragujevac, Serbia
شاپا
2251-86572251-8665
Related items
Showing items related by title, author, creator and subject.
-
$Z_k$-Magic Labeling of Some Families of Graphs
Jeyanthi, P.؛ Jeyadaisy, K. (University of Tehran, 2018-12-01)For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ ...
-
Graphs with smallest forgotten index
Gutman, Ivan؛ Ghalavand, Ali؛ Dehghan-Zadeh, T.؛ Ashrafi, Ali Reza (University of Kashan, 2017-09-01)The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all ...
-
On eigenspaces of some compound complex unit gain graphs
Belardo, Francesco؛ Brunetti, Maurizio (University of Isfahan, 2022-09-01)Let $\mathbb T$ be the multiplicative group of complex units, and let $L(\Phi)$ denote the Laplacian matrix of a nonempty $\mathbb{T}$-gain graph $\Phi=(\Gamma, \mathbb{T}, \gamma)$. The gain line graph $\mathcal L(\Phi)$ ...




