Results 31 to 40 of about 3,567 (160)

Hamiltonicity and Eulerianity of Some Bipartite Graphs Associated to Finite Groups

Journal of the Indonesian Mathematical Society, 2023
Let G be a finite group. Associate a simple undirected graph Γ_G with G, called bipartite graph associated to elements and cosets of subgroups of G, as follows : Take G ∪ S_G as the vertices of Γ_G, with S_G is the set of all subgroups of a group G and ...
Yeni Susanti, Niswah Qonita
semanticscholar   +1 more source

Akram B. Attar EXTENSIBILITY OF GRAPHS

مجلة علوم ذي قار, 2019
In this paper, the concepts of extension of a graph(digraph) and the extensible class of graphs(digraphs) have been introduced. The class of connected graphs as well as the class of Hamiltonian graphs which are extensible classes have also been proved ...
Akram Attar
doaj   +4 more sources

Connecting graphs with R-hypermodules via normal fuzzy subhypermodules [PDF]

Journal of Hyperstructures
In this paper, we analyze the connection between R-hypermodules and graphs by associating a graph with an R- hypermodule through a normal fuzzy subhypermodule.
Fatemeh Niyazi, Razieh Mahjoob, Reza Ameri   +2 more
doaj   +1 more source

Decomposing tournaments into paths

Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo, Viresh Patel, Jozef Skokan, John Talbot   +3 more
wiley   +1 more source

Cycle decompositions of pathwidth‐6 graphs

Journal of Graph Theory, Volume 94, Issue 2, Page 224-251, June 2020., 2020
Abstract Hajós' conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most ⌊ ( n − 1 ) / 2 ⌋ cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new techniques to construct cycle decompositions.
Elke Fuchs, Laura Gellert, Irene Heinrich   +2 more
wiley   +1 more source

Central Configurations and Action Minimizing Orbits in Kite Four‐Body Problem

Advances in Astronomy, Volume 2020, Issue 1, 2020., 2020
In the current article, we study the kite four‐body problems with the goal of identifying global regions in the mass parameter space which admits a corresponding central configuration of the four masses. We consider two different types of symmetrical configurations.
B. Benhammouda, A. Mansur, M. Shoaib, I. Szücs-Csillik, D. Offin, Elbaz I. Abouelmagd   +5 more
wiley   +1 more source

Total Semirelib Graph [PDF]

, 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

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, B Courcelle, B Courcelle, B Courcelle, DG Corneil, ED Demaine, F Gurski, F Gurski, F Harary, FV Fomin, G Chartrand, H-J Lai, HL Bodlaender, I Razgon, J Flum, L Clark, P Dey, P Hliněnỳ, PA Catlin, R Niedermeier, RA Brualdi, RG Downey, S-I Oum, T-H Lai, TH Cormen, W Espelage, Z Ryjácek, Z-H Chen   +27 more
core   +1 more source

Asymmetric Traveling Salesman Path and Directed Latency Problems [PDF]

, 2009
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nodes s and t, both problems ask to find an s-t path visiting all other nodes.
Friggstad, Zachary, Salavatipour, Mohammad R., Svitkina, Zoya   +2 more
core   +7 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