Results 21 to 30 of about 832,958 (281)
Families of nested completely regular codes and distance-regular graphs [PDF]
, 2014 In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming ...
Borges, J., Rifà, J., Zinoviev, V. A.
core +5 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
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
Sublinear Distance Labeling [PDF]
, 2016 A distance labeling scheme labels the $n$ nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels.
Alstrup, Stephen +3 more
core +3 more sources
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]
, 2010 The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar +2 more
core +5 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
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
On the editing distance of graphs [PDF]
, 2008 An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\mathcal{G}$, the editing distance from $G$ to $\mathcal{G}$ is the smallest number of edge ...
Axenovich +24 more
core +2 more sources