Abstract
ABSTRACT A is a graph whose edges carry the weight ‘+’ or ‘−’. A signed graph S is called sign-regular if is same for all and is same for all . The problems of embedding -sign-regular signed graphs in -sign-regular signed graphs is one of the fascinating problem from application point of view which is dealt in this paper with insertion of least number of vertices in S and the problem of finding least number of non-isomorphic co-regular signed graphs is explored. We also define the relationship between characteristic polynomial of graph G and the graph in which it embeds.
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.
