Results 1 to 10 of about 52,307 (305)
On the vertex-degree based invariants of digraphs [PDF]
Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $φ$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{φ(d_u^+,d_v^-)}$, where $d_u^+$ (resp. $d_u^-$) denotes the out-degree (resp. in-degree) of a vertex $u$.
Hanyuan Deng +4 more
doaj +4 more sources
Vertex degree weighted path indices
Vertex degree weighted path indices PN(a, b, ...), for example P1(a, b), P2(a, b, c), P3(a, b, c, d), and P4(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|max up to 0.999.
Anton Perdih
doaj +5 more sources
Degree distance and vertex-connectivity
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Ali +2 more
exaly +3 more sources
On vertex-disjoint cycles and degree sum conditions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronald J. Gould +2 more
exaly +3 more sources
Estimating vertex-degree-based energies [PDF]
Introduction/purpose: In the current literature, several dozens of vertexdegree-based (VDB) graph invariants are being studied. To each such invariant, a matrix can be associated.
Ivan Gutman
doaj +1 more source
The transition metal is a planar metallic organic structure, and tetra-cyano-benzene is one of the most studied networks of 3D series of transition metal.
Nida Zahra, Muhammad Ibrahim
doaj +1 more source
Vertex degrees close to the average degree
Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular, for $d_+\in \left(\sqrt{dn},n-1\right]$, we show the existence of a vertex in $G$ of degree between $d_+-\left ...
Johannes Pardey, Dieter Rautenbach
openaire +3 more sources
THE DEGREE ON CHAIN OF FUZZY GRAPHS
In this paper, we discussed some types of degrees on chains of fuzzy graphs. also introduced a new type of degree, which is called an average degree.
Russel H. Majeed, Nabeel E. Arif
doaj +1 more source
Subdomination in Graphs with Upper-Bounded Vertex Degree
We find a lower bound for the k-subdomination number on the set of graphs with a given upper bound for vertex degrees. We study the cases where the proposed lower bound is sharp, construct the optimal graphs and indicate the corresponding k-subdominating
Darya Lemtyuzhnikova +4 more
doaj +1 more source
Toughness and Vertex Degrees [PDF]
AbstractWe study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t‐tough. We first give a best monotone theorem when , but then show that for any integer , a best monotone theorem for requires at least nonredundant conditions, where grows superpolynomially as .
Douglas Bauer +4 more
openaire +4 more sources

