Results 81 to 90 of about 202 (134)
Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
Open Mathematics, 2019 Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)=12∑u,v∈V(G)(dG(u,v)+dG2(u,v))$\begin{array}{} WW(G)=\frac{1}{2}\sum\limits_{u,v\in V(G)}(d_{G}(u,v)+d^{2}_{G}(u,v)) \end{array}$, where dG(u, v) is the ...
Wu Tingzeng, Lü Huazhong
doaj +1 more source
The Serial Transitive Closure Problem for Trees
, 2002 The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G.
core
Computational analysis for eccentric neighborhood Zagreb indices and their significance. [PDF]
Heliyon, 2023 Ahmed H +4 more
europepmc +1 more source
Power graphs and exchange property for resolving sets
Open Mathematics, 2019 Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source
Invariant Factors of Graphs associated with Hyperplane Arrangements
, 1998 A matrix called Varchenko matrix associated with a hyperplane arrangement was defined by Varchenko in 1991. Matrices that we shall call q-matrices are induced from Varchenko matrices.
Wai Chee Shiu
core
Symmetries and symmetry-breaking in arithmetic graphs. [PDF]
Heliyon, 2023 Shah A, Javaid I, Rehman SU.
europepmc +1 more source
Invariant Factors of Graphs associated with Hyperplane Arrangements
, 2008 A matrix called Varchenko matrix associated with a hyperplane arrangement was defined by Varchenko in 1991. Matrices that we shall call q-matrices are induced from Varchenko matrices.
Wai Chee Shiu
core
Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants. [PDF]
Molecules, 2023 Chu ZQ +5 more
europepmc +1 more source
, 1998 We introduce n-semimetrics as a common extension of n-metrics and certain recent applied notions like the 2-way distance. The n-semimetrics are totally symmetric maps from E n+1 into R+ satisfying the simplex inequality, a direct extension of the ...
M. -m. Deza +4 more
core
A cospectral construction for the generalized distance matrix
Special MatricesThe generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj.
Friesen Ori +5 more
doaj +1 more source