Results 11 to 20 of about 175,962 (155)

Alpha graphs with different pendent paths

Electronic Journal of Graph Theory and Applications, 2020
Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj   +2 more sources

An Approach to the Geometric-Arithmetic Index for Graphs under Transformations’ Fact over Pendent Paths

Complexity, 2021
Graph theory is a dynamic tool for designing and modeling of an interconnection system by a graph. The vertices of such graph are processor nodes and edges are the connections between these processors nodes. The topology of a system decides its best use.
Muhammad Asif, Hamad Almohamedh, Muhammad Hussain, Khalid M Alhamed, Abdulrazaq A. Almutairi, Sultan Almotairi   +5 more
doaj   +2 more sources

Minimum atom-bond sum-connectivity index of trees with a fixed order and/or number of pendent vertices [PDF]

AIMS Mathematics, 2022
Let $ d_u $ be the degree of a vertex $ u $ of a graph $ G $. The atom-bond sum-connectivity (ABS) index of a graph $ G $ is the sum of the numbers $ (1-2(d_v+d_w)^{-1})^{1/2} $ over all edges $ vw $ of $ G $. This paper gives the characterization of the
Tariq A. Alraqad, Igor Ž. Milovanović, Hicham Saber , Akbar Ali, Jaya P. Mazorodze , Adel A. Attiya   +5 more
doaj   +2 more sources

ALPHA LABELINGS OF DISJOINT UNION OF HAIRY CYCLES

Ural Mathematical Journal
In this paper, we prove the following results: 1) the disjoint union of \(n\geq 2\) isomorphic copies of the graph which is obtained by adding a pendent edge to each vertices of the cycle of order 4 admits \(\alpha\)-valuation; 2) the disjoint union of ...
G. Rajasekaran, L. Uma
doaj   +2 more sources

On Unicyclic Graphs with a Given Number of Pendent Vertices or Matching Number and Their Graphical Edge-Weight-Function Indices

Mathematics
Consider a unicyclic graph G with edge set E(G). Let f be a real-valued symmetric function defined on the Cartesian square of the set of all distinct elements of G’s degree sequence. A graphical edge-weight-function index of G is defined as If(G)=∑xy∈E(G)
Akbar Ali, Abdulaziz M. Alanazi, Taher S. Hassan, Yilun Shang   +3 more
doaj   +2 more sources

Restrained captive domination number

Open Engineering
The restrained captive domination number (RCDN), denoted by γRca(G),{\gamma }_{{\rm{Rca}}}(G), is a new definition of domination number in graphs introduced in this article.
Alrikabi Zainab Yasir, Omran Ahmed A., Hwaeer Hassan Jiad Al   +2 more
doaj   +2 more sources

Graphical edge-weight-function indices of trees

AIMS Mathematics
Consider a tree graph $ G $ with edge set $ E(G) $. The notation $ d_G(x) $ represents the degree of vertex $ x $ in $ G $. Let $ \mathfrak{f} $ be a symmetric real-valued function defined on the Cartesian square of the set of all distinct elements of ...
Akbar Ali, Sneha Sekar, Selvaraj Balachandran, Suresh Elumalai, Abdulaziz M. Alanazi, Taher S. Hassan, Yilun Shang   +6 more
doaj   +2 more sources

Exponential second Zagreb index of connected graphs [PDF]

Discrete Mathematics Letters
For a graph G = ( V, E ) , the exponential second Zagreb index is defined as e M 2 ( G ) = (cid:80) uv ∈ E ( G ) e d u d v , where d v denotes the degree of a vertex v ∈ V ( G ) .
Batmend Horoldagva, Lkhagva Buyantogtokh, Shiikhar Dorjsembe   +2 more
doaj   +2 more sources

Families of graphs with twin pendent paths and the Braess edge [PDF]

The Electronic Journal of Linear Algebra, 2021
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices.
Sooyeon Kim
semanticscholar   +1 more source

The Gutman Index of the Unicyclic Graphs with pendent edges

Journal of Physics: Conference Series, 2021
The graph-parameters mainly studies vertex degree and distance between unordered vertices. There are many graph-parameters, and this paper mainly focuses on the Gutman index.
Meng-meng Feng, Xiangran Yu, Jing Zhang, Wei Duan   +3 more
semanticscholar   +1 more source