Results 21 to 30 of about 24,879 (166)
Isometric Hamming embeddings of weighted graphs
Discrete Applied Mathematics, 2023 A mapping $ : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we consider isometric embeddings of a weighted graph $G$ into unweighted Hamming graphs, called Hamming embeddings, when $G$
Joseph Berleant +4 more
openaire +3 more sources
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
EPJ Web of ConferencesMapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
Eccentric Harmonic Index for the Cartesian Product of Graphs
Journal of Mathematics, 2022 Suppose ρ is a simple graph, then its eccentric harmonic index is defined as the sum of the terms 2/ea+eb for the edges vavb, where ea is the eccentricity of the ath vertex of the graph ρ. We symbolize the eccentric harmonic index (EHI) as He=Heρ.
Kamel Jebreen +5 more
doaj +1 more source
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
Low-Floor Tanner Codes via Hamming-Node or RSCC-Node Doping [PDF]
, 2006 We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC (proto-)graphs, by which we mean Hamming or recursive systematic convolutional (RSC) code ...
Abu-Surra, Shadi +2 more
core +1 more source
On generalised Paley graphs and their automorphism groups [PDF]
, 2009 The generalised Paley graphs are, as their name suggests, a generalisation of the Paley graphs, first defined by Paley in 1933 (see \cite{Paley}). They arise as the relation graphs of symmetric cyclotomic association schemes.
Lim, Tian Khoon, Praeger, Cheryl E.
core +1 more source
Total mutual-visibility in Hamming graphs [PDF]
Opuscula MathematicaIf \(G\) is a graph and \(X \subseteq V(G)\), then \(X\) is a total mutual-visibility set if every pair of vertices \(x\) and \(y\) of \(G\) admits the shortest \(x,y\)-path \(P\) with \(V(P) \cap X \subseteq \{x,y\}\).
Csilla Bujtás +2 more
doaj +1 more source
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
The improved hamming number method to detect isomorphism for kinematic chain with multiple joints
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2017 During the process of kinematic structure enumeration using graph theory, isomorphism identification of graphs is an important and complicated problem.
Wei SUN, Jianyi KONG, Liangbo SUN
doaj +1 more source
Strong Edge-Coloring of Hamming Graphs
Proceedings of Computer Science and Information Technologies 2023 Conference, 2023 An edge coloring of a graph G is a mapping Á : EG ! N. The edge coloring Á is called strong if Áe 6= Áe0 for any two edges e and e0 that are distance at most one apart. The minimum number of colors needed for a strong edge coloring of a graph G is called strong chromatic index of G and denoted by Â0 sG.
Drambyan, A., Petrosyan, P.
openaire +2 more sources