vertex degree
Recently Published Documents


TOTAL DOCUMENTS

197
(FIVE YEARS 66)

H-INDEX

17
(FIVE YEARS 2)

2022 ◽  
Vol 70 (1) ◽  
pp. 13-23
Author(s):  
Ivan Gutman

Introduction/purpose: In the current literature, several dozens of vertex-degree-based (VDB) graph invariants are being studied. To each such invariant, a matrix can be associated. The VDB energy is the energy (= sum of the absolute values of the eigenvalues) of the respective VDB matrix. The paper examines some general properties of the VDB energy of bipartite graphs. Results: Estimates (lower and upper bounds) are established for the VDB energy of bipartite graphs in which there are no cycles of size divisible by 4, in terms of ordinary graph energy. Conclusion: The results of the paper contribute to the spectral theory of VDB matrices, especially to the general theory of VDB energy.


2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Michal Koucký ◽  
Vojtěch Rödl ◽  
Navid Talebanfard

We show that for every $r \ge 2$ there exists $\epsilon_r > 0$ such that any $r$-uniform hypergraph with $m$ edges and maximum vertex degree $o(\sqrt{m})$ contains a set of at most $(\frac{1}{2} - \epsilon_r)m$ edges the removal of which breaks the hypergraph into connected components with at most $m/2$ edges. We use this to give an algorithm running in time $d^{(1 - \epsilon_r)m}$ that decides satisfiability of $m$-variable $(d, k)$-CSPs in which every variable appears in at most $r$ constraints, where $\epsilon_r$ depends only on $r$ and $k\in o(\sqrt{m})$. Furthermore our algorithm solves the corresponding #CSP-SAT and Max-CSP-SAT of these CSPs. We also show that CNF representations of unsatisfiable $(2, k)$-CSPs with variable frequency $r$ can be refuted in tree-like resolution in size $2^{(1 - \epsilon_r)m}$. Furthermore for Tseitin formulas on graphs with degree at most $k$ (which are $(2, k)$-CSPs) we give a deterministic algorithm finding such a refutation.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Aqsa Khalid ◽  
Nasreen Kausar ◽  
Mohammad Munir ◽  
Hassen Aydi ◽  
Sajida Kousar ◽  
...  

In this research article, we determine some vertex degree-based topological indices or descriptors of two families of graphs, i.e., G = C 4 K n and G = C 4 K n + v 1 v 3 , where C 4 K n is a graph obtained by identifying one of the vertices of K n with one vertex of C 4 . Similarly, a graph formed by joining one of the vertices of K n with one vertex of C 4 + v 1 v 3 is known as the C 4 K n + v 1 v 3 graph.


2021 ◽  
Vol 49 (1) ◽  
Author(s):  
Abhay Rajpoot ◽  
◽  
Lavanya Selvaganesh ◽  

Miliˇcevi´c et al., in 2004, introduced topological indices known as Reformulated Zagreb indices, where they modified Zagreb indices using the edge-degree instead of vertex degree. In this paper, we present a simple approach to find the upper and lower bounds of the second reformulated Zagreb index, EM2(G), by using six graph operations/transformations. We prove that these operations significantly alter the value of reformulated Zagreb index. We apply these transformations and identify those graphs with cyclomatic number at most 3, namely trees, unicyclic, bicyclic and tricyclic graphs, which attain the upper and lower bounds of second reformulated Zagreb index for graphs.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Akbar Ali ◽  
Waqas Iqbal ◽  
Zahid Raza ◽  
Ekram E. Ali ◽  
Jia-Bao Liu ◽  
...  

In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G , its vertex-degree-based topological indices of the form BID G = ∑ u v ∈ E G β d u , d v are known as bond incident degree indices, where E G is the edge set of G , d w denotes degree of an arbitrary vertex w of G , and β is a real-valued-symmetric function. Those BID indices for which β can be rewritten as a function of d u + d v − 2 (that is degree of the edge u v ) are known as edge-degree-based BID indices. A connected graph G is said to be r -apex tree if r is the smallest nonnegative integer for which there is a subset R of V G such that R = r and G − R is a tree. In this paper, we address the problem of determining graphs attaining the maximum or minimum value of an arbitrary BID index from the class of all r -apex trees of order n , where r and n are fixed integers satisfying the inequalities n − r ≥ 2 and r ≥ 1 .


Symmetry ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1903
Author(s):  
Juan Monsalve ◽  
Juan Rada

A vertex-degree-based (VDB, for short) topological index φ induced by the numbers φij was recently defined for a digraph D, as φD=12∑uvφdu+dv−, where du+ denotes the out-degree of the vertex u,dv− denotes the in-degree of the vertex v, and the sum runs over the set of arcs uv of D. This definition generalizes the concept of a VDB topological index of a graph. In a general setting, we find sharp lower and upper bounds of a symmetric VDB topological index over Dn, the set of all digraphs with n non-isolated vertices. Applications to well-known topological indices are deduced. We also determine extremal values of symmetric VDB topological indices over OTn and OG, the set of oriented trees with n vertices, and the set of all orientations of a fixed graph G, respectively.


10.37236/9608 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Shimon Kogan

Let $\text{rep}(G)$ be the maximum multiplicity of a vertex degree in graph $G$. It was proven in Caro and West [E-JC, 2009] that if $G$ is an $n$-vertex line graph, then $\text{rep}(G) \geqslant \frac{1}{4} n^{1/3}$. In this note we prove that for infinitely many $n$ there is a $n$-vertex line graph $G$ such that $\text{rep}(G) \leqslant \left(2n\right)^{1/3}$, thus showing that the bound above is asymptotically tight. Previously it was only known that for infinitely many $n$ there is a $n$-vertex line graph $G$ such that $\text{rep}(G) \leqslant \sqrt{4n/3}$ (Caro and West [E-JC, 2009]). Finally we prove that if $G$ is a $n$-vertex line graph, then $\text{rep}(G) \geqslant \left(\left(\frac{1}{2}-o(1)\right)n\right)^{1/3}$.


Sign in / Sign up

Export Citation Format

Share Document