IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v359y2019icp194-201.html
   My bibliography  Save this article

On the maximum value of the eccentric distance sums of cubic transitive graphs

Author

Listed:
  • Xie, Yan-Ting
  • Xu, Shou-Jun

Abstract

Let Γ be a simple connected graph with vertex set V(Γ). The eccentric distance sum (EDS for short) of Γ is defined as ξd(Γ)=∑v∈V(Γ)εΓ(v)DΓ(v), where ɛΓ(v) is the eccentricity of a vertex v and DΓ(v) is the sum of all distances from v to other vertices. In the paper Li and Wu [11], the strict upper bound on ξd(Γ) among the k-connected graphs Γ with an integer k even were given, and proposed an open question: the corresponding problem on k-connected graphs with k odd. In this paper, first, we divide cubic transitive graphs into two cases: super-connectedness and non-super-connectedness, and characterized non-super-connected cubic transitive graphs, filling the gaps in this field. Then, by using the characterization, we show the upper bound on EDS among (3-connected) cubic transitive graphs of order n and characterize the extremal graphs: the ladders when n≡0(mod4) and the ladders or the Möbius ladders when n≡2(mod4). Finally, we conclude the paper with conjectures about the upper bound on EDS of k-connected graphs with odd integer k ≥ 3.

Suggested Citation

  • Xie, Yan-Ting & Xu, Shou-Jun, 2019. "On the maximum value of the eccentric distance sums of cubic transitive graphs," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 194-201.
    • Handle: RePEc:eee:apmaco:v:359:y:2019:i:c:p:194-201
    DOI: 10.1016/j.amc.2019.04.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319303042
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.04.022?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:apmaco:v:359:y:2019:i:c:p:194-201. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.