Results 61 to 70 of about 305 (179)
Computing the vertex separation of unicyclic graphs
Information and Computation, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John A. Ellis, Minko Markov
openaire +1 more source
Selection of an Optimal Warehouses Using Global Regular Domination in Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.Let G = (V, E) be a simple graph. A subset S of V (G) is said to be global dominating set if S is a dominating set of the given graph G and its complement G. A subset whose induced subgraph is regular in G is also regular in G. A dominating set D of V (G) is called a regular dominating set if hSi is regular. In this article, we introduce global regular
R. Sundareswaran +6 more
wiley +1 more source
Stress in Directed Graphs: A Generalization of Graph Stress
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.In graph theory, centrality measures are used to identify the most important or influential nodes within a network. Stress centrality is one such measure, which helps quantify how “stressed” a node is within the overall graph structure based on the number of shortest paths that pass through it. Stress centrality provides a more thorough assessment of a
K. V. Madhumitha +4 more
wiley +1 more source
A note on the minimum reduced reciprocal Randic index of n-vertex unicyclic graphs
Kuwait Journal of Science, 2017 Recent studies show that the reduced reciprocal Randi? (RRR) index possesses the second-best correlating ability amongthe several well known topological indices.
Akbar Ali, Akhlaq A. Bhatti
doaj
The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights
Discrete Dynamics in Nature and Society, 2018 The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs ...
Young Chel Kwun +4 more
doaj +1 more source
On the eccentric connectivity index of unicyclic graphs
, 2018 Summary: In this paper, we obtain the upper and lower bounds on the eccentricity connectivity index of unicyclic graphs with perfect matchings. Also, we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
Nacaroglu, Yasar, Maden, Ayse Dilek
openaire +2 more sources
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
Journal of Mathematics, Volume 2025, Issue 1, 2025.Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif +5 more
wiley +1 more source
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
Electronic Journal of Graph Theory and Applications, 2019 We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necesary conditions are satisfied.
John Fahnenstiel, Dalibor Froncek
doaj +1 more source
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source
Greedoids on Vertex Sets of Unicycle Graphs
CoRR, 2009 9 pages; 4 ...
Vadim E. Levit, Eugen Mandrescu
openaire +2 more sources