Abstract
In this paper, we study sequential labeling problem of graph, by applying the methods of mapping analysis and adjacency matrix, some sufficient and necessary conditions for sequential labeling are obtained, and the method for judging a sequential labeling by computer is given. Uniqueness problem of sequential labeling and sequential labeling of graph S(Gn) and J(G) are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.