Results 71 to 80 of about 1,106 (97)
On Topological Indices of mth Chain Hex-Derived Network of Third Type
Frontiers in Physics, 2020 In theoretical chemistry, the numerical parameters that are used to characterize the molecular topology of graphs are called topological indices. Several physical and chemical properties like boiling point, entropy, heat formation, and vaporization ...
Yuhong Huo +5 more
doaj +1 more source
Graph measures and network robustness
, 2013 Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to continue to ...
Ellens, W., Kooij, R. E.
core
The Smallest Harmonic Index of Trees with Given Maximum Degree
Discussiones Mathematicae Graph Theory, 2018 The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/[d(u) + d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.
Rasi Reza, Sheikholeslami Seyed Mahmoud
doaj +1 more source
Diameters of commuting graphs of matrices over semirings
, 2010 We calculate the diameters of commuting graphs of matrices over the binary Boolean semiring, the tropical semiring and an arbitrary nonentire commutative semiring.
Bukovšek, Damjana Kokol +2 more
core
The general position problem and strong resolving graphs
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
Computational analysis for eccentric neighborhood Zagreb indices and their significance. [PDF]
Heliyon, 2023 Ahmed H +4 more
europepmc +1 more source
Symmetries and symmetry-breaking in arithmetic graphs. [PDF]
Heliyon, 2023 Shah A, Javaid I, Rehman SU.
europepmc +1 more source
Strong edge geodetic problem in networks
Open Mathematics, 2017 Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul +4 more
doaj +1 more source
Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants. [PDF]
Molecules, 2023 Chu ZQ +5 more
europepmc +1 more source
Four-point condition matrices of edge-weighted trees
Special MatricesFormulas for the determinant of distance matrix DT{D}_{T} of tree TT are known in the unweighted case and in the case when the edges of TT have commuting variable weights. Associated with the four-point condition (4PC) and a tree TT are two matrices, the
Azimi Ali +3 more
doaj +1 more source