مرکز اطلاعات علمی 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:

27
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

1
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Maximum Variable Connectivity Index of n-Vertex Trees

Pages

  33-44

Abstract

 In QSAR and QSPR studies the most commonly used topological index was proposed by chemist Milan Randić in 1975 called Randić branching index or path-one molecular connectivity index, 1χ and it has many applications. In the extension of connectivity indices, in early 1990s, chemist Milan Randic´ introduced Variable Randić index defined as ∑v1v2∈E(G) ((dv1 + θ*)(dv2 + θ*))−1/2, where θ* is a non-negative real number and dv1 is the degree of vertex V1 in G. The main objective of the present study is to prove the conjecture proposed in [19]. In this study, we will show that the Pn (path graph) has the maximum Variable connectivity index among the collection of Trees whose order is n, where n ≥ 4.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button