Results 41 to 50 of about 95 (92)
Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm
Journal of Intelligent Systems, 2018 Neutrosophy (neutrosophic logic) is used to represent uncertain, indeterminate, and inconsistent information available in the real world. This article proposes a method to provide more sensitivity and precision to indeterminacy, by classifying the ...
Kandasamy Ilanthenral
doaj +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
Main Group Metal ChemistryFor a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez +5 more
doaj +1 more source
Computational and Mathematical BiophysicsAspirin, one of the most widely produced and consumed pharmaceuticals globally, presents an ideal case for exploring sustainable synthesis methods in pharmaceutical manufacturing.
Rooban Sanjai Shanmugavel Kannan +1 more
doaj +1 more source
Some new bounds on resolvent energy of a graph
Open MathematicsLet 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
Analele 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∈SdegG(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj +1 more source
Fast algorithms for determining (generalized) core groups in social networks
Core, Large network, Decomposition, Graph algorithm, 05A18, 05C70, 05C85, 05C90, 68R10, 68W40, 92H30, 92G30, 93A15,
Vladimir Batagelj, Matjaž Zaveršnik
core +1 more source
Comparison between Szeged indices of graphs
, 2020 The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edges e = uv of G, where nu(e) is the number of vertices of G lying closer to u than v, and nv(e) is defined analogously. The aim of this paper is to present
Ghalavand, A +2 more
core
Degree-based topological properties of borophene sheets
Main Group Metal ChemistryThis 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
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