Abstract

The research of Boolean index sets of graphs is one of the important graph theory in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to Z 2 . It's theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The edge-balance index set is an important issue in Boolean index set. In this paper, we defined edge-friendly labeling of the graph, edge-balance index set of the graph and the graph C nm × P mn (n=4,m≥2). We completely determine the edge-balance index sets of the graph C nm × P mn (m ≡ 0(mod 3)) and solve formula proof and graphic tectonic methods.

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 call

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.