Results 11 to 20 of about 56 (56)
On the Harary Estrada index of graphs
Let GG be a connected graph with nn vertices v1,…,vn{v}_{1},\ldots ,{v}_{n}. The Harary matrix of GG, denoted by H(G)H\left(G), is an n×nn\times n matrix with a zero main diagonal, where the (i,j)\left(i,j)-entry is 1d(vi,vj)\frac{1}{d\left({v}_{i},{v}_ ...
Oboudi Mohammad Reza
doaj +1 more source
The Second Maximum Mostar Index of Unicyclic Graphs With Given Diameter
Topological invariants are key tools for studying the physicochemical and thermodynamic properties of chemical compounds. Recently, a new bond‐additive distance‐based graph invariant called the Mostar index has been developed. It measures the importance of individual edges and the graph as a whole. It is denoted and defined as MoG=∑xy∈EGnxxy−nyxy. This
Muhammad Amer Qureshi +5 more
wiley +1 more source
Topological indices play a central role in mathematical chemistry for correlating structural features of molecular graphs with physicochemical properties.
Noreen Tahira, Salman Muhammad
doaj +1 more source
Abstract Background Diff‐Quik (DQ) staining is widely used in clinical practice for its ease of use and rapid results. However, its potential contamination remains a concern. Hypothesis/Objectives This study aimed to investigate DQ solution contamination in veterinary hospitals and identify factors affecting it through a questionnaire on stain usage ...
Minji Cho, Seulgi Bae
wiley +1 more source
For 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
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
The minimum exponential atom-bond connectivity energy of trees
Let G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj +1 more source
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
In graph theory, the Randic index (R) is a topological graph invariant widely used as a physicochemical descriptor in the mathematical modeling of molecular structures. However, traditional molecular graphs fail to capture the heterogeneity of chemical bonds, since they treat all edges as uniform, ignoring variations in bond lengths and strengths.
Ying Wang +5 more
wiley +1 more source
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
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

