Results 121 to 130 of about 175,962 (155)

Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)

Frontiers of Mathematics in China, 2020
Let $$\mathbb{S}$$ S ( m, d, k ) be the set of k -uniform supertrees with m edges and diameter d , and S 1 ( m, d, k ) be the k -uniform supertree obtained from a loose path u 1 , e 1 , u 2 , e 2 , …, u d , e d , u d +1 with length d by attaching m – d ...
Cunxiang Duan, Ligong Wang, Peng Xiao
semanticscholar   +2 more sources

ASCENDING PENDENT DOMINATION DECOMPOSITION OF GRAPHS

, 2020
Let G = (V,E) be a simple connected graph. A subset S of vertices in a graph G is called a dominating set if every vertex v ∈ V is either in S or adjacent to some vertex in S.
V. Brishni, V.Maheswari, K. D. Arasi
semanticscholar   +1 more source

On the sigma index of chemical graphs with a given order, number of edges and pendent vertices

Journal of Combinatorial Mathematics and Combinatorial Computing
The chemical graphs are graphs that have no vertex with degree greater than 4. The sigma index of a graph \(G\) is defined by \(\sum_{uv\in E(G)} (deg_{G}(u)-deg_{G}(v))^{2}\), where \(deg_{G}(u)\) stands for the degree of vertex \(u\) in \(G\).
Xiaoling Sun, Jianwei Du, Yinzhen Mei
semanticscholar   +1 more source

Extremal vertex-degree function index of trees with some given parameters

Filomat
For a graph G, the vertex-degree function index of G is defined as Hf (G) = ?u?V(G) f(degG(u)), where degG(u) stands for the degree of vertex u in G and f(x) is a function defined on positive real numbers.
Xiaoling Sun, Jianwei Du, Yinzhen Mei
semanticscholar   +1 more source

Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter

Japan journal of industrial and applied mathematics, 2021
R. Farooq, S. Akhter, J. Rada
semanticscholar   +2 more sources

Analyzing ESCD-Number for Unique Graph Structures

Journal of Physics: Conference Series
The concept of external staircase corona domination number of graph introduced by G. Mahadevan et. al [9]. A dominating set S ⊆ V is said to be an external staircase corona dominating set (ESCD-set), if every vertex in < S > is either a pendent vertex or
G. Mahadevan, K. Priya, C. Sivagnanam
semanticscholar   +1 more source

Reduced Sombor index of graphs

Journal of Discrete Mathematical Sciences and Cryptography
Gutman developed the concept of Sombor indices and it was shown that any vertex degree-based graph invariant can be viewed as a reduced Sombor-type index.
Shiikhar Dorjsembe, Lkhagva Buyantogtokh, B. Horoldagva   +2 more
semanticscholar   +1 more source

Characterizations of Bounds and Tree Structures for the Hyperbolic Sombor Index

Journal of Advances in Mathematics and Computer Science
For a simple graph G with order n and size m. We study the Hyperbolic Sombor index HSO(G) = \(\sum_{u v \in E} \frac{\sqrt{d_u^2+d_v^2}}{\min \left\{d_u, d_v\right\}}\), where du and dv are the degrees of vertices u and v respectively, a recently ...
Mitesh J. Patel, Kajal. S. Baldaniya
semanticscholar   +1 more source

Degree-Based Index Optimization in Trees with Pendant Constraints

Punjab University journal of mathematics
Graphs are used in mathematics to mathematically depict networks, which are essentially collections of interconnected things. The topology and structure of networks and molecular graphs can be better understood with the help of topological indices which ...
Salma Kanwal, Khadija Sarwar
semanticscholar   +1 more source

The distance spectrum of the complements of graphs with two pendent vertices

Indian journal of pure and applied mathematics, 2022
Xinfa Chen, Guoping Wang
semanticscholar   +1 more source