Add to ORKGIn this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Hamiltonian circuits have been discussed. It has been found that the intersection graph obtained from Euler Diagram is not Hamiltonian. The graph H(3m + 7, 6m + 14) for m ≥ 1, which is planner, regular of degree four, non-bipartite but Hamiltonian graph, has perfect matching 4 with non- repeated edge for simultaneous changes of m = 2n+1 for n≥0
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
Some fundamental properties of a graph are defined in terms of the edge-edge incidence matrix associ...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, a...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
Some fundamental properties of a graph are defined in terms of the edge-edge incidence matrix associ...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, a...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...