Results 81 to 90 of about 180 (113)
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
On the radius of neighborhood graphs
, 2016 The k-step graph G′k of a graph G has the same vertex set as G and two vertices are adjacent in G ′ k if and only if there exists a path of length k connecting them in G. The graph G ′ 2 is called the neighborhood graph of G.
Vetrík, Tomás, Mukwembi, Simon
core
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
, 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
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
, 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
On zero-divisors of near-rings of polynomials
, 2019 In this paper, we are interested to study zero-divisor properties of a 0- symmetric nearring of polynomials R0[x], when R is a commutative ring. We show that for a reduced ring R, the set of all zero-divisors of R0[x], namely Z(R0[x]), is an ideal of R0 ...
Shokuhifar, Fatemeh +2 more
core
Topological Indices and New Graph Structures
, 2012 A topological representation of a molecule can be carried out through molecular graph. The descriptors are numerical values associated with chemical constitution for correlation of chemical structure with various physical properties, chemical reactivity ...
S Ramakrishnan, J Baskar Babujee
core
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