Results 21 to 30 of about 4,703 (164)
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ .
David R. Wood
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
PLoS Computational Biology, 2021 Graphs such as de Bruijn graphs and OLC (overlap-layout-consensus) graphs have been widely adopted for the de novo assembly of genomic short reads. This work studies another important problem in the field: how graphs can be used for high-performance ...
Yuansheng Liu, Jinyan Li
doaj +1 more source
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
SSRN Electronic Journal, 2007 It is shown that the Hamming graph \(H(3,q)\) with diameter three is uniquely determined by its spectrum for \(q\geq 36\). It is also demonstrated that for given integer \(D\geq 2\), any graph cospectral with the Hamming graph \(H(D,q)\) is locally the disjoint union of \(D\) copies of the complete graph of size \(q-1\), for \(q\) large enough.
Bang, S, van Dam, ER, Koolen, JH
openaire +8 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
The Square of Some Generalized Hamming Graphs
Mathematics, 2023 In this paper, we study the square of generalized Hamming graphs by the properties of abelian groups, and characterize some isomorphisms between the square of generalized Hamming graphs and the non-complete extended p-sum of complete graphs.
Yipeng Li, Jing Zhang, Meili Wang
doaj +1 more source
On induced subgraphs of the Hamming graph [PDF]
Journal of Graph Theory, 2020 AbstractIn connection with his solution of the Sensitivity Conjecture, Hao Huang (arXiv: 1907.00847, 2019) asked the following question: Given a graph with high symmetry, what can we say about the smallest maximum degree of induced subgraphs of with vertices, where denotes the size of the largest independent set in ?
openaire +2 more sources
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
Journal of Graph Algorithms and Applications, 2020 Our objective is to discover the topology of an energy distribution network modeled by a flow digraph from which we know the set of arcs without identification of their extremities.
Wilfried Ehounou +4 more
doaj +1 more source