Keywords:Invariant property; Hamilton cycle; Cartesian product; Tensor product Abstract. To determine whether or not a given graph has a Hamilton cycle (or is a planar graph), defined the operations invariant properties on graphs, and discussed the various forms of the invariant properties under the circumstance of Cartesian product graph operation and Tensor product graph operation. The main conclusions include: The Hamiltonicity of graph is invariant concerning the Cartesian product, and the non-planarity of the graph is invariant concerning the tensor product. Therefore, when we applied these principles into practice, we testified that Hamilton cycle does exist in hypercube and the Desargues graph is a non-planarity graph
International audienceA graph is hamiltonian if it contains a cycle which goes through all vertices ...
Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
Abstract. In this paper we investigate the closedness of some known operations on certain kinds of g...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
summary:During the last decade, several research groups have published results on sufficient conditi...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
In this paper, the characterization of bipartite graph will be first described by using the definiti...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
In this paper, the characterization of a bipartite graph will be first described by using the defini...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...
AbstractIn this paper, tensor product of two regular complete multipartite graphs is shown to be Ham...
In this paper, we investigate a problem of finding natural condition to assure the product of two gr...
International audienceA graph is hamiltonian if it contains a cycle which goes through all vertices ...
Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
Abstract. In this paper we investigate the closedness of some known operations on certain kinds of g...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
summary:During the last decade, several research groups have published results on sufficient conditi...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
In this paper, the characterization of bipartite graph will be first described by using the definiti...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
In this paper, the characterization of a bipartite graph will be first described by using the defini...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...
AbstractIn this paper, tensor product of two regular complete multipartite graphs is shown to be Ham...
In this paper, we investigate a problem of finding natural condition to assure the product of two gr...
International audienceA graph is hamiltonian if it contains a cycle which goes through all vertices ...
Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...