Results 11 to 20 of about 80 (79)
Variantes del problema del cartero mixto que se pueden resolver usando programación lineal [PDF]
Revista de Matemática: Teoría y Aplicaciones, 2012 Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro.
Francisco Javier Zaragoza Martínez +1 more
doaj +3 more sources
HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit [PDF]
, 2022 HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit Dr.(Prof.) Keshava Prasad Halemane, Professor - retired from Department of Mathematical And Computational Sciences ...
HALEMANE, KESHAVA PRASAD
core +1 more source
On stability of the Hamiltonian index under contractions and closures [PDF]
, 2005 The hamiltonian index of a graph G is the smallest integer k such that the k-th iterated line graph of G is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to
Liming Xiong +6 more
core +1 more source
Spanning paths and cycles in triangle-free graphs [PDF]
, 2021 Let G bea triangle-free graph of order n and minimum degree δ > n/3. We will determine all lengths of cycles occurring in G. In particular, the length of a longest cycle or path in G is exactly the value admitted by the independence number of G.
Mushanyu, J., Mafuta, P.
core
Dissecting a square into congruent polygons [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number $\geq 3$, it is ...
Hui Rao, Lei Ren, Yang Wang
doaj +1 more source
Hamiltonian paths on Platonic graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 30, Page 1613-1616, 2004., 2004 We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate topologically distinct Hamiltonian cycles on the icosahedron graph and to show that a regular graph
Brian Hopkins
wiley +1 more source
Old and new generalizations of line graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 29, Page 1509-1521, 2004., 2004 Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge‐isomorphism implies isomorphism except for K3 and K1,3. The line graph transformation is one of the most widely studied of all graph transformations.
Jay Bagga
wiley +1 more source
Longest cycles in certain bipartite graphs
International Journal of Mathematics and Mathematical Sciences, Volume 21, Issue 1, Page 103-106, 1998., 1995 Let G be a connected bipartite graph with bipartition (X, Y) such that |X| ≥ |Y|(≥2), n = |X| and m = |Y|. Suppose, for all vertices x ∈ X and y ∈ Y, dist(x, y) = 3 implies d(x) + d(y) ≥ n + 1. Then G contains a cycle of length 2m. In particular, if m = n, then G is hamiltomian.
Pak-Ken Wong
wiley +1 more source
Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2020 In this paper, we investigate the number of Hamiltonian cycles of a generalized Petersen graph P (N, k) and prove that Ψ(P(N,3))⩾N⋅αN,\Psi ( {P ( {N,3} )} ) \ge N \cdot {\alpha _N}, where Ψ(P(N, 3)) is the number of Hamiltonian cycles of P(N, 3) and αN ...
Lu Weihua, Yang Chao, Ren Han
doaj +1 more source
Hamiltonian‐connected graphs and their strong closures
International Journal of Mathematics and Mathematical Sciences, Volume 20, Issue 4, Page 745-747, 1997., 1993 Let G be a simple graph of order at least three. We show that G is Hamiltonian‐connected if and only if its strong closure is Hamiltonian‐connected. We also give an efficient algorithm to compute the strong closure of G.
Pak-Ken Wong
wiley +1 more source