Main Article Content
Abstract
Graph theory concepts are widely used to study and model various applications in different areas such as computer graphics, electrical network analysis and operation research. A Hamiltonian cycle in a graph is a cycle that visits each vertex exactly once. These concepts helps in routing power gating design to reduce the leakage of power by break the flow of inactive circuit domains. A connected graph is 2-connected if at most one vertex is removed the graph remains connected. A spanning 2-connected subgraph is in which every vertex has degree 2. In this paper we studied Hamilton cycles and Spanning 2-connected sub graphs for 3-corner and 4-corner rectangular grid graphs.