In this paper the sufficient condition for a graph to be Hamiltonian and non-Hamiltonian are discussed. Some simple results on tree with permanent of A(T) and X(T). If G is a Bipartite graph with #X = #Y = n such that per A(G) = (n!), then G is a complete bipartite graph. Also some results in permanent of A(G) of separable graphs, equivalence and partial order relations are discussed.
M. Arul S. Raj and Dr. Somasundaram K., “Results on Permanents and Graphs”, Mathematics Preprint Archive, no. 10, 2002.