Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Maximizing the Mostar index for bipartite graphs and split graphs
    Miklavič, Štefko ...
    ▫$Do\v{s}li\'{c}$▫ et al.~defined the Mostar index of a graph ▫$G$▫ as ▫$\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$▫, where, for an edge ▫$uv$▫ of ▫$G$▫, the term ▫$n_G(u,v)$▫ denotes the number of ... vertices of ▫$G$▫ that have a smaller distance in▫$G$▫ to ▫$u$▫ than to ▫$v$▫. Contributing to conjectures posed by ▫$Do\v{s}li\'{c}$▫ et al., we show that the Mostar index of bipartite graphs of order ▫$n$▫ is at most ▫$\frac{\sqrt{3}}{18}n^3$▫, and that the Mostar index of split graphs of order ▫$n$▫ is at most ▫$\frac{4}{27}n^3$▫.
    Vir: Discrete optimization. - ISSN 1572-5286 (Vol. 48, iss. 1, art. 100768, 2023, str. 1-7)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2023
    Jezik - angleški
    COBISS.SI-ID - 144839939

    Povezava(-e):

    https://www.sciencedirect.com/science/article/pii/S1572528623000105?via%3Dihub
    https://doi.org/10.1016/j.disopt.2023.100768
    DOI

vir: Discrete optimization. - ISSN 1572-5286 (Vol. 48, iss. 1, art. 100768, 2023, str. 1-7)
loading ...
loading ...
loading ...

Vnos na polico