Results 31 to 40 of about 3,327 (143)
A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs [PDF]
, 2017 We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is most useful in
Bonvicini, Simona, Pisanski, Toma\u17e
core +1 more source
Parameterized Edge Hamiltonicity
, 2014 We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi +27 more
core +1 more source
Hamiltonicity of 3-arc graphs [PDF]
, 2013 An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy ...
A. Gardiner +19 more
core +2 more sources
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
Journal of Graph Theory, Volume 109, Issue 4, Page 446-453, August 2025.ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES
Jurnal Natural, 2014 Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization.
Al Aiyub, Mahyus Ihsan, Rahma Zuhra
doaj +2 more sources
On the digraph of a unitary matrix
, 2003 Given a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D.
Grössing Gerhard +5 more
core +2 more sources
Energy Science &Engineering, Volume 13, Issue 6, Page 3185-3203, June 2025.The different reflux hole areas. ABSTRACT To investigate the impact of the reflux hole area on the self‐priming performance of a self‐priming pump, this study innovatively established a circulating pipeline system that includes the self‐priming pump, water tank, and other components.
Ying‐Yu Ji +4 more
wiley +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Goudar, Venkanagouda, Prasad, Manjunath
core +2 more sources
On the wave turbulence theory of 2D gravity waves, I: Deterministic energy estimates
Communications on Pure and Applied Mathematics, Volume 78, Issue 2, Page 211-322, February 2025.Abstract Our goal in this paper is to initiate the rigorous investigation of wave turbulence and derivation of wave kinetic equations (WKEs) for water waves models. This problem has received intense attention in recent years in the context of semilinear models, such as Schrödinger equations or multidimensional KdV‐type equations. However, our situation
Yu Deng +2 more
wiley +1 more source
Thoughts on Barnette's Conjecture [PDF]
, 2013 We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation.
Alt, Helmut +3 more
core