IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i13p2043-d1426207.html
   My bibliography  Save this article

A Matrix Approach to Vertex-Degree-Based Topological Indices

Author

Listed:
  • Roberto Cruz

    (Instituto de Matemáticas, Universidad de Antioquia, Medellín 050010, Colombia)

  • Carlos Espinal

    (Instituto de Matemáticas, Universidad de Antioquia, Medellín 050010, Colombia)

  • Juan Rada

    (Instituto de Matemáticas, Universidad de Antioquia, Medellín 050010, Colombia)

Abstract

A VDB (vertex-degree-based) topological index over a set of digraphs H is a function φ : H → R , defined for each H ∈ H as φ H = 1 2 ∑ u v ∈ E φ d u + d v − , where E is the arc set of H , d u + and d v − denote the out-degree and in-degree of vertices u and v respectively, and φ i j = f ( i , j ) for an appropriate real symmetric bivariate function f . It is our goal in this article to introduce a new approach where we base the concept of VDB topological index on the space of real matrices instead of the space of symmetric real functions of two variables. We represent a digraph H by the p × p matrix α H , where α H i j is the number of arcs u v such that d u + = i and d v − = j , and p is the maximum value of the in-degrees and out-degrees of H . By fixing a p × p matrix φ , a VDB topological index of H is defined as the trace of the matrix φ T α ( H ) . We show that this definition coincides with the previous one when φ is a symmetric matrix. This approach allows considering nonsymmetric matrices, which extends the concept of a VDB topological index to nonsymmetric bivariate functions.

Suggested Citation

  • Roberto Cruz & Carlos Espinal & Juan Rada, 2024. "A Matrix Approach to Vertex-Degree-Based Topological Indices," Mathematics, MDPI, vol. 12(13), pages 1-11, June.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2043-:d:1426207
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/13/2043/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/13/2043/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yang, Jiaxiang & Deng, Hanyuan, 2022. "Maximum first Zagreb index of orientations of unicyclic graphs with given matching number," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    2. Bermudo, Sergio & Cruz, Roberto & Rada, Juan, 2022. "Vertex-degree-based topological indices of oriented trees," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2043-:d:1426207. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.