Results 21 to 30 of about 836,691 (279)
On the distance spectrum of certain distance biregular graphs
The American Journal of Combinatorics, 2023 In this article we present an infinite family of bipartite distance biregular graphs having an arbitrarily large diameter and whose distance matrices have exactly four distinct eigenvalues. This result answers a question posed by F.
Miriam Abdon +2 more
doaj +1 more source
Coloring, location and domination of corona graphs [PDF]
, 2012 A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs
EURASIP Journal on Wireless Communications and Networking, 2007 LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into
Gabofetswe Malema, Michael Liebelt
doaj +2 more sources
Weiner Polynomials for Generalization of Distance for Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2006 The minimum distance of a vertex v to an set of vertices of a graph G is defined as : . The n-Wiener polynomial for this distance of a graph G is defined as , where is the number of order pairs (v,S), , such that , and is the diameter
Ali Ali, Ahmed Ali
doaj +1 more source
Stability of Reeb graphs under function perturbations: the case of closed curves [PDF]
, 2010 Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on the manifold.
Di Fabio, Barbara, Landi, Claudia
core +2 more sources
Asymptotic Delsarte cliques in distance-regular graphs [PDF]
, 2015 We give a new bound on the parameter $\lambda$ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph $G$, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014).
Babai, László, Wilmes, John
core +2 more sources
Solutions of Detour Distance Graph Equations
Sensors, 2022 Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha +7 more
doaj +1 more source
The distance spectrum of two new operations of graphs [PDF]
Transactions on Combinatorics, 2020 Let $G$ be a connected graph with vertex set $V(G)=\{v_1, v_2,\ldots,v_n\}$. The distance matrix $D=D(G)$ of $G$ is defined so that its $(i,j)$-entry is equal to the distance $d_G(v_i,v_j)$ between the vertices $v_i$ and $v_j$ of $G$. The eigenvalues
Zikai Tang +3 more
doaj +1 more source
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
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