Benutzer: Gast  Login
Autor(en):
Hanjo Täubig 
Titel:
Inequalities for the Number of Walks in Subdivision Graphs 
Abstract:
We consider an undirected graph $G$ with $n$ vertices and $m$ edges that is modified by introducing an intermediate vertex on every edge. It has been shown by Ilic and Stevanovic that this subdivision graph $S_G$ satisfies the inequality $M_1(S_G)/(m+n)\le M_2(S_g)/(2m)$ for the Zagreb indices $M_1$ and $M_2$. This inequality can also be expressed as $w_1(S_G) w_2(S_G) \le w_0(S_G) w_3(S_G)$, where $w_k(G)$ denotes the number of $k$-step walks in $G$. Besides trees, this is anoth...    »
 
Stichworte:
number of walks, inequalities, subdivision graphs 
Jahr:
2015 
Sprache:
en