Abstract
This paper uses a new matrix analysis tool, the semi-tensor product of matrices (STP), to investigate the problem of searching k-internally stable set (k-ISS) and k-maximum internally stable set (k-MISS) of graphs, which serve as mathematical models of analizing many concrete realworld problems such as the k-track assignment problem. By introducing a characteristic vector for vertex subsets of graphs and using the STP, several new sufficient and necessary conditions of the k-ISS and k-MISS are obtained, based on which an algorithm able to find out all k-ISSs and k-MISSs of graphs is established. The results are quite different from existing methods and provide a new angle and means to understand and analyze the structure of graphs. The correctness of the results is finally examined by several illustration examples.
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 callDisclaimer: 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.
