Abstract
Binary operations are in general more difficult to implement when compared with unary operations. Normally any operation on a graph involves vertices or edges or both together. In general two graphs are involved in binary operation. Hajos construction is one such operation which involves vertices and edges with three operations. So two graphs with three operations on vertices and edges increases the difficulty in implanting it. Computation time increases when this operation is to be verified for all possible edge pairs between the two graphs. A matrix representation for this purpose would enable easy computation. In this paper we have provided a matrix method of verifying if two graphs are Hajos stable.
Sign-in/Register to access full text options 
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
