Download This PaperResults on Permanents and Graphs
Science Direct Working Paper No S1574-0358(04)70343-3
15 Pages Posted: 20 Mar 2018
Date Written: October 2002
Abstract
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.
Keywords: Permanent, adjacency and incidence matrix, Hamiltonian graph, tree, bipartite graph, connectivity of a graph, equivalence and partial order relations
Suggested Citation: Suggested Citation
Arul Raj, S. Maria and Somasundaram, K., Results on Permanents and Graphs (October 2002). Science Direct Working Paper No S1574-0358(04)70343-3, Available at SSRN: https://ssrn.com/abstract=3142701
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN