Abstract
The ordered pair , where G is an underlying graph and is a signature function, is called a signed graph. A nonsingular signed graph is said to satisfy strong reciprocal (or strong anti-reciprocal) eigenvalue property if for each eigenvalue there exists (or ) in the spectrum of having same multiplicities, if we remove this multiplicity constraint then the signed graph is said to satisfy reciprocal (respectively anti-reciprocal) eigenvalue property. In this article, we investigate strong anti-reciprocal eigenvalue property in some families of signed graphs.
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.
