Results 71 to 80 of about 187 (132)
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
Comparison between Szeged indices of graphs
, 2020 The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edges e = uv of G, where nu(e) is the number of vertices of G lying closer to u than v, and nv(e) is defined analogously. The aim of this paper is to present
Ghalavand, A +2 more
core
, 2010 In this paper the isometry between two fuzzy graphs is defined. Nature of the isometry relation and concepts regarding isomorphism and isometry is discussed. Antipodal fuzzy graph of the given fuzzy graph is defined.
J Malarvizhi, A Nagoor Gani
core
Characterizations of connected orthogonality graphs of projections of Rickert *-rings
, 2019 In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular.
Waphare, B.N., Patil, Avinash A.
core
Computing the Metric Dimension of a Graph from Primary Subgraphs
Discussiones Mathematicae Graph Theory, 2017 Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . .
Kuziak Dorota +2 more
doaj +1 more source
Fully discrete high resolution schemes for systems of conservation laws [PDF]
, 1994 Effective and robust high resolution schemes are of vital importance for simulation of viscous and inviscid flows. Since second-order high resolution schemes in practice are inadquate for many applications, large efforts have been put towards ...
Shi, Jian
core
On the spectral radius and energy of the degree distance matrix of a connected graph
Open MathematicsLet GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
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
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