Results 31 to 40 of about 92 (88)

Fast algorithms for determining (generalized) core groups in social networks

open access: yes
Core, Large network, Decomposition, Graph algorithm, 05A18, 05C70, 05C85, 05C90, 68R10, 68W40, 92H30, 92G30, 93A15,
Vladimir Batagelj, Matjaž Zaveršnik
core   +1 more source

Some new bounds on resolvent energy of a graph

open access: yesOpen Mathematics
Let GG be a simple graph of order nn with eigenvalues λ1≥λ2≥…≥λn.{\lambda }_{1}\ge {\lambda }_{2}\ge \ldots \ge {\lambda }_{n}. The resolvent energy of GG is a spectrum-based graph invariant defined as ER(G)=∑i=1n(n−λi)−1.{\rm{ER}}(G)={\sum }_{i=1}^{n ...
Altındağ İlkay   +1 more
doaj   +1 more source

Steiner Degree Distance of Two Graph Products

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈Sdeg⁡G(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj   +1 more source

Degree-based topological properties of borophene sheets

open access: yesMain Group Metal Chemistry
This study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali   +3 more
doaj   +1 more source

Modeling Power System Failure Risk Using Intuitionistic Fuzzy Graphs

open access: yes
Power systems are essential infrastructures for electricity generation, transmission, and distribution, where failures can cause significant operational and economic impacts.
K. Umamaheswari
core   +1 more source

Computation of the Resistance Distance Metric in Two Classes of DNA Network

open access: yes
Introduction: Resistance distance, originating from electrical network theory, provides a powerful framework for characterizing the structural and topological properties of chemical graphs.
Jun Yang, Wasim Sajjad
core   +1 more source

Dynamic graph-theoretical optimization of aspirin synthesis with adaptive catalytic pathways for superior green chemistry performance

open access: yesComputational and Mathematical Biophysics
Aspirin remains one of the world’s most widely produced pharmaceuticals, yet its conventional manufacturing pathway suffers from rigid process conditions, high energy use, and substantial waste. This study introduces an adaptive dynamic graph-theoretical
Rooban Sanjai Shanmugavel Kannan   +1 more
doaj   +1 more source

Metric Dimension of Irregular Convex Triangular Networks

open access: yesAKCE International Journal of Graphs and Combinatorics
Irregular convex triangular networks consist of the interior of a 6-sided convex polygon drawn on the infinite triangular network. Formal description of these applicable networks is provided.
S. Prabhu   +3 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of molecular trees

open access: yesAKCE International Journal of Graphs and Combinatorics
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy