Results 51 to 60 of about 3,327 (143)
, 2015 We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible.
Farrell, Matthew, Levine, Lionel
core +1 more source
Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
, 2016 The concept of symbolic sequences play important role in study of complex systems. In the work we are interested in ultrametric structure of the set of cyclic sequences naturally arising in theory of dynamical systems.
Osipov, Vladimir Al.
core +1 more source
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. [PDF]
Algorithms Mol Biol, 2023 Schmidt S, Alanko JN.
europepmc +2 more sources
Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs
, 2022 The Gallai middle graph ΓM(G) of a graph G = (V, E) is the graph whose vertex set is V ∪ E and two edges ei, ej ∈ E are adjacent in ΓM(G), if they are adjacent edges of G and do not lie on a same triangle in G, or if ei = uv ∈ E then ei is adjacent to u and v in ΓM(G).
Goyal, Shanu, Jain, Dilip
openaire +1 more source
, 1996 The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core +1 more source
A Study on Edge-Set Graphs of Certain Graphs
, 2015 Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th $s$-element subset of $E(
Chithra, K. P., Kok, Johan, Sudev, N. K.
core +2 more sources
Worm Monte Carlo study of the honeycomb-lattice loop model
, 2011 We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of infinite edge ...
Batchelor +58 more
core +1 more source
The Salesman's Improved Tours for Fundamental Classes
, 2017 Finding the exact integrality gap $\alpha$ for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made.
Boyd, Sylvia, Sebö, András
core
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core +1 more source
The total zero-divisor graph of commutative rings
, 2018 In this paper we initiate the study of the total zero-divisor graphs over commutative rings with unity. These graphs are constructed by both relations that arise from the zero-divisor graph and from the total graph of a ring.
Jevđenić, Sara +3 more
core