اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe generalized distance matrix of digraphs
195
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $D(G)$ and $D^Q(G)= Diag(Tr) + D(G)$ be the distance matrix and distance signless Laplacian matrix of a simple strongly connected digraph $G$, respectively, where $Diag(Tr)=textrm{diag}(D_1,D_2,$ $ldots,D_n)$ be the diagonal matrix with vertex transmissions of the digraph $G$. To track the gradual change of $D(G)$ into $D^Q(G)$, in this paper, we propose to study the convex combinations of $D(G)$ and $Diag(Tr)$ defined by $$D_alpha(G)=alpha Diag(Tr)+(1-alpha)D(G), 0leq alphaleq1.$$ This study reduces to merging the distance spectral and distance signless Laplacian spectral theories. The eigenvalue with the largest modulus of $D_alpha(G)$ is called the $D_alpha$ spectral radius of $G$, denoted by $mu_alpha(G)$. We determine the digraph which attains the maximum (or minimum) $D_alpha$ spectral radius among all strongly connected digraphs. Moreover, we also determine the digraphs which attain the minimum $D_alpha$ spectral radius among all strongly connected digraphs with given parameters such as dichromatic number, vertex connectivity or arc connectivity.
قيم البحث
اقرأ أيضاً
Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{text{dist}(u,v)}$, where $text{dist}(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices are in diffe
rent components, then $q^{text{dist}(u,v)}=0$. In this paper, we will establish several properties of the characteristic polynomial (spectrum) for this matrix, give some families of graphs which are uniquely determined by their spectrum, and produce cospectral constructions.
Let $G$ be a simple, connected graph, $mathcal{D}(G)$ be the distance matrix of $G$, and $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$. The distance Laplacian matrix and distance signless Laplacian matrix of $G$ are defined by $mathca
l{L}(G) = Tr(G)-mathcal{D}(G)$ and $mathcal{Q}(G) = Tr(G)+mathcal{D}(G)$, respectively. The eigenvalues of $mathcal{D}(G)$, $mathcal{L}(G)$ and $mathcal{Q}(G)$ is called the $mathcal{D}-$spectrum, $mathcal{L}-$spectrum and $mathcal{Q}-$spectrum, respectively. The generalized distance matrix of $G$ is defined as $mathcal{D}_{alpha}(G)=alpha Tr(G)+(1-alpha)mathcal{D}(G),~0leqalphaleq1$, and the generalized distance spectral radius of $G$ is the largest eigenvalue of $mathcal{D}_{alpha}(G)$. In this paper, we give a complete description of the $mathcal{D}-$spectrum, $mathcal{L}-$spectrum and $mathcal{Q}-$spectrum of some graphs obtained by operations. In addition, we present some new upper and lower bounds on the generalized distance spectral radius of $G$ and of its line graph $L(G)$, based on other graph-theoretic parameters, and characterize the extremal graphs. Finally, we study the generalized distance spectrum of some composite graphs.
For a connected graph $G:=(V,E)$, the Steiner distance $d_G(X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $X$. The $k-$Steiner distance matrix $D_k(G)$ of $G$ is a matrix whose
rows and columns are indexed by $k-$subsets of $V$. For $k$-subsets $X_1$ and $X_2$, the $(X_1,X_2)-$entry of $D_k(G)$ is $d_G(X_1 cup X_2)$. In this paper, we show that the rank of $2-$Steiner distance matrix of a caterpillar graph on $N$ vertices and with $p$ pendant veritices is $2N-p-1$.
We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk that is perturbed by a certain complex-valued function defined by digraphs. The discriminant of this quantum walk is a matrix that is a certain normalization of ge
neralized Hermitian adjacency matrices. Furthermore, we give definitions of the positive and negative supports of the transfer matrix, and clarify explicit formulas of their supports of the square. In addition, we give tables by computer on the identification of digraphs by their eigenvalues.
We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
