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

Extremal Results on ℓ -Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices

Author

Listed:
  • Jing Zeng

    (School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China)

  • Hechao Liu

    (School of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, China)

  • Lihua You

    (School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China)

Abstract

A graph of order n is called pancyclic if it contains a cycle of length y for every 3 ≤ y ≤ n . The connectivity of an incomplete graph G , denoted by κ ( G ) , is min { | W | | W i s a v e r t e x c u t o f G } . A graph G is said to be ℓ -connected if the connectivity κ ( G ) ≥ ℓ . The Wiener-type indices of a connected graph G are W g ( G ) = ∑ { s , t } ⊆ V ( G ) g ( d G ( s , t ) ) , where g ( x ) is a function and d G ( s , t ) is the distance in G between s and t . In this note, we first determine the minimum and maximum values of W g ( G ) for ℓ -connected graphs. Then, we use the Wiener-type indices of graph G , the Wiener-type indices of complement graph G ¯ with minimum degree δ ( G ) ≥ 2 or δ ( G ) ≥ 3 to give some sufficient conditions for connected graphs to be pancyclic. Our results generalize some existing results of several papers.

Suggested Citation

  • Jing Zeng & Hechao Liu & Lihua You, 2024. "Extremal Results on ℓ -Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices," Mathematics, MDPI, vol. 13(1), pages 1-16, December.
    • Handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:10-:d:1551697
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/1/10/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/1/10/
    Download Restriction: no
    ---><---

    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:13:y:2024:i:1:p:10-:d:1551697. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.