Results 121 to 130 of about 3,567 (160)
Some of the next articles are maybe not open access.
On hamiltonian line graphs of hypergraphs
Journal of Graph Theory, 2022A graph is supereulerian if it has a spanning eulerian subgraph. Harary and Nash‐Williams in 1968 proved that the line graph of a graph G is hamiltonian if and only if G has a dominating eulerian subgraph, Jaeger in 1979 showed that every 4‐edge ...
Xiaofeng Gu, H. Lai, Sulin Song
semanticscholar +1 more source
A note on Hamiltonian cycles in planar graphs
Discret. Math. Algorithms Appl., 2022Unlike the problem of finding Eulerian cycles, the problem of deciding whether a given graph has a Hamiltonian cycle is NP-complete, even when restricting to planar graphs. There are however some criteria that can be used in special cases.
M. Kreh
semanticscholar +1 more source
, 2010 Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs
Journal of Intelligent & Fuzzy Systems, 2018Graph theory includes two unavoidable graphs, namely Euler graphs and Hamiltonian graphs. In this study, generalized fuzzy Euler graphs (GFEGs) and generalized fuzzy Hamiltonian graphs (GFHGs) are defined to express uncertain system like routes, networks.
Sovan Samanta, B. Sarkar
semanticscholar +1 more source
On Computing the Hamiltonian Index of Graphs
Computer Science Symposium in Russia, 2019The $r$-th iterated line graph $L^{r}(G)$ of a graph $G$ is defined by: (i) $L^{0}(G) = G$ and (ii) $L^{r}(G) = L(L^{(r- 1)}(G))$ for $r > 0$, where $L(G)$ denotes the line graph of $G$.
Geevarghese Philip +2 more
semanticscholar +1 more source
ON SOME PROPERTIES OF CAYLEY GRAPHS OF RECTANGULAR BANDS
, 2020A rectangular band is a direct product of left zero semigroup and right zero semigroup. Arthur Cayley introduced Cayley graphs of groups in 1878 and Cayley graphs of semigroups are its generalizations.
A. Riyas, P. Anusha, K. Geetha
semanticscholar +1 more source
Unit Regular Graphs over Finite Rings
Journal of Algebra Combinatorics Discrete Structures and ApplicationsThis paper introduces the concept of a unit regular graph over any given ring. The unit regular graph is a simple undirected graph, where its vertices correspond to elements of the ring.
Yeni Susanti +4 more
semanticscholar +1 more source
Hyperideal-based intersection graphs
Indian journal of pure and applied mathematics, 2022M. Hamidi, R. Ameri, Hoda Mohammadi
semanticscholar +1 more source
Eulerian and Hamiltonian Walks
From Domination to Coloring, 2019G. Chartrand +3 more
semanticscholar +1 more source