Results 21 to 30 of about 124 (74)

Note on the temperature Sombor index [PDF]

open access: yes, 2023
Introduction/purpose: The temperature of a vertex of a graph of the order n is defined as d/(n-d), where d is the vertex degree. The temperature variant of the Sombor index is investigated and several of its properties established. Methods: Combinatorial
Ivan Gutman
core   +1 more source

Social Capital, Creative Destruction and Economic Development [PDF]

open access: yes, 2005
This paper develops a conceptual framework for the role of social capital in the political economy of innovation, growth and reform, with illustrations from developing and transition countries.
Bezemer, Dirk   +2 more
core   +4 more sources

Disproof of a conjecture on the minimum Wiener index of signed trees

open access: yes, 2022
The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math.
Guo, Songlin, Wang, Chuanming, Wang, Wei
core  

Mathematical and chemistry properties of geometry-based invariants

open access: yes, 2022
Recently, based on elementary geometry, Gutman proposed several geometry-based invariants (i.e., $SO$, $SO_{1}$, $SO_{2}$, $SO_{3}$, $SO_{4}$, $SO_{5}$, $SO_{6}$). The Sombor index was defined as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$,
Liu, Hechao
core   +1 more source

Harmonic–Arithmetic Index for the Generalized Mycielskian Graphs and Graphenes With Curvilinear Regression Models of Benzenoid Hydrocarbons

open access: yesComputational and Mathematical Methods, Volume 2025, Issue 1, 2025.
The generalized Mycielskian graphs are known for their advantageous properties employed in interconnection networks in parallel computing to provide efficient and optimized network solutions. This paper focuses on investigating the bounds and computation of the harmonic–arithmetic index of the generalized Mycielskian graph of path graph, cycle graph ...
Pooja Danushri Namidass   +2 more
wiley   +1 more source

On the Clean Graph of a Ring

open access: yes, 2023
Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R.
Patekar, S. C., Singh, Randhir
core  

Harmonic‐Arithmetic Index: Lower Bound for n‐Order Trees With Fixed Number of Pendant Vertices and Monogenic Semigroup for Graph Operations

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
Graph theory combined with chemistry provides a strong framework for modeling and assessing chemical compounds. By representing molecules as graphs and applying topological indices, chemists can gain profound insights into the physical and chemical characteristics of compounds.
Kalpana R.   +2 more
wiley   +1 more source

Extremal polygonal chains with respect to the Kirchhoff index

open access: yes, 2023
The Kirchhoff index is defined as the sum of resistance distances between all pairs of vertices in a graph. This index is a critical parameter for measuring graph structures.
Ma, Qi
core  

On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees

open access: yesJournal 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

Quasi-Laplacian energy of fractal graphs [PDF]

open access: yes
Graph energy is a measurement of determining the structural information content of graphs. The first Zagreb index can be handled with its connection to graph energy.
BERBERLER, MURAT ERSEN
core   +2 more sources

Home - About - Disclaimer - Privacy