Results 51 to 60 of about 3,335 (132)
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
, 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
, 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
Complexity of Token Swapping and its Variants
, 2018 In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their destinations, using the minimum number of swaps, i.e., operations of ...
Bonnet, Édouard +2 more
core +1 more source
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
Continuous-time quantum walk based centrality testing on weighted graphs. [PDF]
Sci Rep, 2022 Wang Y, Xue S, Wu J, Xu P.
europepmc +1 more source
Factors and Connected Factors in Tough Graphs with High Isolated Toughness
, 2019 In this paper, we show that every $1$-tough graph with order and isolated toughness at least $r+1$ has a factor whose degrees are $r$, except for at most one vertex with degree $r+1$.
Hasanvand, Morteza
core
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
Quantum computing algorithms: getting closer to critical problems in computational biology. [PDF]
Brief Bioinform, 2022 Marchetti L +8 more
europepmc +1 more source
Genome assembly using quantum and quantum-inspired annealing. [PDF]
Sci Rep, 2021 Boev AS +7 more
europepmc +1 more source