Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

497
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

174
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

5

Information Journal Paper

Title

THE HYPER-WIENER POLYNOMIAL OF GRAPHS

Pages

  67-74

Abstract

 The distance d (u, v) between two vertices u and v of a graph Gis equal to the length of a shortest path that connects u and v. Define WW (G, x) =1/2 S [a, b]ÍV (G) x d (a, b)+d2 (a, b), where d (G) is the greatest distance between any two vertices. In this paper the HYPER-WIENER POLYNOMIALs of the Cartesian product, composition, join and disjunction of graphs are computed.

Cites

References

  • No record.

    • Cite

    APA: Copy

    FATH TABAR, G.H., & ASHRAFI, A.R.. (2011). THE HYPER-WIENER POLYNOMIAL OF GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 6(2), 67-74. SID. https://sid.ir/paper/310326/en

    Vancouver: Copy

    FATH TABAR G.H., ASHRAFI A.R.. THE HYPER-WIENER POLYNOMIAL OF GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2011;6(2):67-74. Available from: https://sid.ir/paper/310326/en

    IEEE: Copy

    G.H. FATH TABAR, and A.R. ASHRAFI, “THE HYPER-WIENER POLYNOMIAL OF GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 6, no. 2, pp. 67–74, 2011, [Online]. Available: https://sid.ir/paper/310326/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops





    Move to top