Abstract
A selected tour of the theory of identification matrices is offered here. We show that shortest-path adjacency matrices are identification matrices for all simple graphs and adjacency matrices are identification matrices for all bipartite graphs. Additionally, we provide an improved proof that augmented adjacency matrices satisfying the circular 1's property are identification matrices. In passing, we present a matrix characterization of doubly convex bipartite graphs. As an application of the theory of identification matrices, we describe an improved method for testing isomorphism of Γ circular arc graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
