اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFurther Inequalities Between Vertex-Degree-Based Topological Indices
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Continuing the recent work of L. Zhong and K. Xu [MATCH Commun. Math. Comput. Chem.71(2014) 627-642], we determine inequalities among several vertex-degree-based topological indices; first geometric-arithmetic index(GA), augmented Zagreb index (AZI), Randi$acute{c}$ index (R), atom-bond connectivity index (ABC), sum-connectivity index (X)and harmonic index (H).
قيم البحث
اقرأ أيضاً
Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $varphi$ of $D$ is defined as a summation over all arcs, $I(D) = frac{1}{2}sum_{uvin A}{varphi(d_u^+,d_v^-)}$, where $d_u^+$ (res
p. $d_u^-$) denotes the out-degree (resp. in-degree) of a vertex $u$. In this paper, we give the extremal values and extremal digraphs of $I(D)$ over all digraphs with $n$ non-isolated vertices. Applying these results, we obtain the extremal values of some vertex-degree based topological indices of digraphs, such as the Randi{c} index, the Zagreb index, the sum-connectivity index, the $GA$ index, the $ABC$ index and the harmonic index, and the corresponding extremal digraphs.
Let $G$ be a nontrivial connected and vertex-colored graph. A subset $X$ of the vertex set of $G$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ is called emph{rainbow vertex-disconnected} if for any two vertices $x$
and $y$ of $G$, there exists a vertex subset $S$ such that when $x$ and $y$ are nonadjacent, $S$ is rainbow and $x$ and $y$ belong to different components of $G-S$; whereas when $x$ and $y$ are adjacent, $S+x$ or $S+y$ is rainbow and $x$ and $y$ belong to different components of $(G-xy)-S$. Such a vertex subset $S$ is called a emph{rainbow vertex-cut} of $G$. For a connected graph $G$, the emph{rainbow vertex-disconnection number} of $G$, denoted by $rvd(G)$, is the minimum number of colors that are needed to make $G$ rainbow vertex-disconnected. In this paper, we obtain bounds of the rainbow vertex-disconnection number of a graph in terms of the minimum degree and maximum degree of the graph. We give a tighter upper bound for the maximum size of a graph $G$ with $rvd(G)=k$ for $kgeqfrac{n}{2}$. We then characterize the graphs of order $n$ with rainbow vertex-disconnection number $n-1$ and obtain the maximum size of a graph $G$ with $rvd(G)=n-1$. Moreover, we get a sharp threshold function for the property $rvd(G(n,p))=n$ and prove that almost all graphs $G$ have $rvd(G)=rvd(overline{G})=n$. Finally, we obtain some Nordhaus-Gaddum-type results: $n-5leq rvd(G)+rvd(overline{G})leq 2n$ and $n-1leq rvd(G)cdot rvd(overline{G})leq n^2$ for the rainbow vertex-disconnection numbers of nontrivial connected graphs $G$ and $overline{G}$ with order $ngeq 24$.
The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was a result of H`{a}n, Person and Schacht who proved that the asymptotic
minimum vertex degree threshold for a perfect matching in an $n$-vertex $3$-graph is $left(frac{5}{9}+o(1)right)binom{n}{2}$. In this paper we improve on this result, giving a family of degree sequence results, all of which imply the result of H`{a}n, Person and Schacht, and additionally allow one third of the vertices to have degree $frac{1}{9}binom{n}{2}$ below this threshold. Furthermore, we show that this result is, in some sense, tight.
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the graphs attain
ing the minimum degree-based graph entropy among graphs and bipartite graphs with a given number of vertices and edges. We characterize the unique extremal graph achieving the minimum value among graphs with a given number of vertices and edges and present a lower bound for the degree-based entropy of bipartite graphs and characterize all the extremal graphs which achieve the lower bound. This implies the known result due to Cao et al. (2014) that the star attains the minimum value of the degree-based entropy among trees with a given number of vertices.
We introduce and study a digraph analogue of Stanleys $psi$-graphical arrangements from the perspectives of combinatorics and freeness. Our arrangements form a common generalization of various classes of arrangements in literature including the Catal
an arrangement, the Shi arrangement, the Ish arrangement, and especially the arrangements interpolating between Shi and Ish recently introduced by Duarte and Guedes de Oliveira. The arrangements between Shi and Ish all are proved to have the same characteristic polynomial with all integer roots, thus raising the natural question of their freeness. We define two operations on digraphs, which we shall call king and coking elimination operations and prove that subject to certain conditions on the weight $psi$, the operations preserve the characteristic polynomials and freeness of the associated arrangements. As an application, we affirmatively prove that the arrangements between Shi and Ish all are free, and among them only the Ish arrangement has supersolvable cone.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
