A note on the edge general position number of cactus graphs
For a given graph G, a subset S of E(G) is an edge general position set of G if no triple of S is contained in a common shortest path. The cardinality of a largest edge general position set of G is called the edge general position number of G, denoted by
Cao Yahan, Ji Shengjin
doaj +1 more source
Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains. [PDF]
Wei S, Ke X, Hao G.
europepmc +1 more source
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Gao W +3 more
europepmc +1 more source
On the Laplacian spectral radii of Halin graphs. [PDF]
Jia H, Xue J.
europepmc +1 more source
Harary index of the zero divisor graph of upper triangular matrices. [PDF]
Alshanqiti O, Sharma S, Bhat VK.
europepmc +1 more source
[2020]Primary 05C25, 37B99; Secondary 05C12, 68R10
zeinab Shahini, M. Eshaghi Gordji
openalex +1 more source
Sombor characteristic values of cographs. [PDF]
Raza Z, Rather BA, Imran M.
europepmc +1 more source
Bounds on the domination number and the metric dimension of co-normal product of graphs. [PDF]
Javaid I, Ur Rehman S, Imran M.
europepmc +1 more source
A graph-theoretic approach to ring analysis: Dominant metric dimensions in zero-divisor graphs. [PDF]
Ali N +4 more
europepmc +1 more source
From Large Deviations to Semidistances of Transport and Mixing: Coherence Analysis for Finite Lagrangian Data. [PDF]
Koltai P, Renger DRM.
europepmc +1 more source

