Results 71 to 80 of about 412,655 (203)
Introducing New Exponential Zagreb Indices for Graphs
Journal of Mathematics, 2021 New graph invariants, named exponential Zagreb indices, are introduced for more than one type of Zagreb index. After that, in terms of exponential Zagreb indices, lists on equality results over special graphs are presented as well as some new bounds on ...
Nihat Akgunes, Busra Aydin
doaj +1 more source
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
AN ISOMORPHISM THEOREM FOR UNICYCLIC GRAPHS
Demonstratio Mathematica, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A New Kind of Dominated Coloring of Some Special Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.This paper introduces the concept of locating‐dominated coloring, a new graph coloring parameter that merges the properties of dominated coloring and locating coloring. For a connected graph G, a locating‐dominated coloring is defined as a proper dominated k‐coloring of G using an ordered partition of V(G) to k‐color classes Π = (C1, C2, …, Ck) such ...
F. Poryousefi +3 more
wiley +1 more source
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
Discussiones Mathematicae Graph Theory, 2014 The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
Degree distance of unicyclic graphs
, 2010 The degree distance of a connected graph G with vertex set V(G) is defined as D'(G)= ?u?V (G) dG (u)DG (u), where dG (u) denotes the degree of vertex u and DG (u) denotes the sum of distances between u and all vertices of G.
Bo Zhou, Zhibin Du
core +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Independence and matching numbers of unicyclic graphs from null space [PDF]
, 2020 We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees ...
Molina, Gonzalo +4 more
core +1 more source
Third Smallest Wiener Polarity Index of Unicyclic Graphs
Frontiers in Physics, 2020 The Wiener polarity index WP(G) of a graph G is the number of unordered pairs of vertices {u,v} where the distance between u and v is 3. In this paper, we determine the third smallest Wiener polarity index of unicyclic graphs. Moreover, the corresponding
Wei Fang +5 more
doaj +1 more source
Locating eigenvalues of unicyclic graphs
, 2017 We present a linear time algorithm that computes the number of eigenvalues of a unicyclic graph in a given real interval. It operates directly on the graph, so that the matrix is not needed explicitly.
Virgínia Rodrigues +2 more
core +1 more source