One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1016/0012-365x(93)e0092-i
Copy DOI
Export
Save
Share
Cite Journal: Discrete Mathematics |  Publication Date: Dec 1, 1994 |
 Citations: 110 |  License type: elsevier-specific: oa user license |
Let G 1 × G 2, G 1 + G 2, G 1[ G 2], G 1 o G 2 and G1{ G 2} be the product, join, composition, corona and cluster, respectively, of the graphs G 1 and G 2. We compute the sum of distances between all pairs of vertices in these composite graphs.
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.
