Results 31 to 40 of about 1,232,284 (259)
Some spectral and quasi-spectral characterizations of distance-regular graphs [PDF]
, 2016 © . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In this paper we consider the concept of preintersection numbers of a graph.
Abiad, Aida +2 more
core +2 more sources
Many distances in planar graphs [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Steiner Wiener index of graph products [PDF]
Transactions on Combinatorics, 2016 The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj
A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs
مجلة بغداد للعلوم, 2023 Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)
BIBIN K JOSE
doaj +1 more source
Mapana Journal of Sciences, 2023 In this paper the coupling distance of simple connected graphs are introduced. The different parameters of coupling distance like coupling eccentricity, coupling radius, coupling diameter, coupling center and coupling periphery are defined. The coupling parameters for different standard graphs are obtained.
Riyaz Ur Rehman A, A Mohamed Ismayil
openaire +1 more source
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
Optimizing Distance Computation in Distributed Graph Systems
IEEE Access, 2020 Given a large graph, such as a social network or a knowledge graph, a fundamental query is how to find the distance from a source vertex to another vertex in the graph.
Qing Wang +5 more
doaj +1 more source
Minimal Graphs with a Specified Code Map Image
Theory and Applications of Graphs, 2018 Let $G$ be a graph and $e_1,\cdots ,e_n$ be $n$ distinct vertices. Let $\rho$ be the metric on $G$. The code map on vertices, corresponding to this list, is $c(x)=(\rho (x,e_1),\cdots ,\rho (x,e_n))$.
Paul Feit
doaj +1 more source
Distances in Domino Flip Graphs
The American Mathematical Monthly, 2017 15 pages, 9 ...
Parlier, Hugo, Zappa, Samuel
openaire +4 more sources
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source