Abstract
Let � ' (G) and � ' (G) be the matching and edge covering number , respectively. The strong product G1⊠G2 of graph of G1 and G2 has vertex set V (G1⊠G2) = V (G1)×V (G2) and edge set E(G1⊠G2) = {(u1,v1)(u2,v2)|(u1u2 ∈ E(G1) and v1v2 ∈ E(G2)) or (u1 = u2 and v1v2 ∈ E(G2)) or (u1u2 ∈ E(G1) and v1 = v2)}. In this paper, we determined generalization of matching number and edge covering number on strong product of complete bipartite graphs and any simple graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Pure and Apllied Mathematics
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.