Results 21 to 30 of about 183 (122)

Sparse Kneser graphs are Hamiltonian

Journal of the London Mathematical Society, Volume 103, Issue 4, Page 1253-1275, June 2021., 2021
Abstract For integers k⩾1 and n⩾2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k‐element subsets of {1,…,n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k+1,k) are also known as the odd graphs.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak   +2 more
wiley   +1 more source

A survey of multiscale modeling: Foundations, historical milestones, current status, and future prospects

AIChE Journal, Volume 67, Issue 3, March 2021., 2021
Abstract Research problems in the domains of physical, engineering, biological sciences often span multiple time and length scales, owing to the complexity of information transfer underlying mechanisms. Multiscale modeling (MSM) and high‐performance computing (HPC) have emerged as indispensable tools for tackling such complex problems.
Ravi Radhakrishnan
wiley   +1 more source

Power graphs: A survey

Electronic Journal of Graph Theory and Applications, 2013
This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Jemal Abawajy, Andrei Kelarev, Morshed Chowdhury   +2 more
doaj   +1 more source

Automorphism Group and Other Properties of Zero Component Graph over a Vector Space

Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021
In this paper, we introduce an undirected simple graph, called the zero component graph on finite‐dimensional vector spaces. It is shown that two finite‐dimensional vector spaces are isomorphic if and only if their zero component graphs are isomorphic, and any automorphism of a zero component graph can be uniquely decomposed into the product of a ...
Shikun Ou, Yanqi Fan, Qunfang Li, Elena Guardo   +3 more
wiley   +1 more source

Catlin’s reduced graphs with small orders

AKCE International Journal of Graphs and Combinatorics, 2020
A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining the reduced nonsupereulerian graphs with small orders, as such results are of particular importance in the study of Eulerian subgraphs and ...
Hong-Jian Lai, Keke Wang, Xiaowei Xie, Mingquan Zhan   +3 more
doaj   +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

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