اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe resistance distance and Kirchhoff index on quadrilateral graph and pentagonal graph
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The quadrilateral graph Q(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 3, whereas the pentagonal graph W(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 4. In this paper, closed-form formulas of resistance distance and Kirchhoff index for quadrilateral graph and pentagonal graph are obtained whenever G is an arbitrary graph.
قيم البحث
اقرأ أيضاً
The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let $L_n$ be a linear hexagonal chain with $n$, 6-cycles. Then identifying the opposite lateral edges of $L_n$ in ordered way yi
elds the linear hexagonal cylinder chain, written as $R_n$. We obtain explicit formulae for the resistance distance $r_{L_n}(i, j)$ (resp. $r_{R_n}(i,j)$) between any two vertices $i$ and $j$ of $L_n$ (resp. $R_n$). To the best of our knowledge ${L_n}_{n=1}^{infty}$ and ${R_n}_{n=1}^{infty}$ are two nontrivial families with diameter going to $infty$ for which all resistance distances have been explicitly calculated. We determine the maximum and the minimum resistance distances in $L_n$ (resp. $R_n$). The monotonicity and some asymptotic properties of resistance distances in $L_n$ and $R_n$ are given. As well we give formulae for the Kirchhoff indices of $L_n$ and $R_n$ respectively.
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $nge2$. In this paper, we study t
he existence of a hamiltonian path in $L^n(G)$, and give a characterization of $G$ for which $L^n(G)$ has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.
A graph $G$ is $k$-path-coverable if its vertex set $V(G)$ can be covered by $k$ or fewer vertex disjoint paths. In this paper, using the $Q$-index of a connected graph $G$, we present a tight sufficient condition for $G$ with fixed minimum degree and large order to be $k$-path-coverable.
Let $ Pi_q $ be the projective plane of order $ q $, let $psi(m):=psi(L(K_m))$ the pseudoachromatic number of the complete line graph of order $ m $, let $ ain { 3,4,dots,tfrac{q}{2}+1 } $ and $ m_a=(q+1)^2-a $. In this paper, we improve the upper
bound of $ psi(m) $ given by Araujo-Pardo et al. [J Graph Theory 66 (2011), 89--97] and Jamison [Discrete Math. 74 (1989), 99--115] in the following values: if $ xgeq 2 $ is an integer and $min {4x^2-x,dots,4x^2+3x-3}$ then $psi(m) leq 2x(m-x-1)$. On the other hand, if $ q $ is even and there exists $ Pi_q $ we give a complete edge-colouring of $ K_{m_a} $ with $(m_a-a)q$ colours. Moreover, using this colouring we extend the previous results for $a={-1,0,1,2}$ given by Araujo-Pardo et al. in [J Graph Theory 66 (2011), 89--97] and [Bol. Soc. Mat. Mex. (2014) 20:17--28] proving that $psi(m_a)=(m_a-a)q$ for $ ain {3,4,dots,leftlceil frac{1+sqrt{4q+9}}{2}rightrceil -1 } $.
We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
