Year-end Sale % OFF 
Abstract
By using the structure of the adjacency matrix of a cordial graph, we characterize cordial graphs, then investigate sufficient conditions for NEPS graphs built from cordial graphs to be cordial. A sub-class of cordial graphs, symmetric balanced cordial graphs, is introduced.
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.
