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

About AutoGraphiX Conjecture on Domination Number and Remoteness of Graphs

Author

Listed:
  • Lidan Pei

    (School of Mathematics and Statistics, Hefei Normal University, Hefei 230601, China)

Abstract

A set D ⊆ V ( G ) is called a dominating set if N [ v ] ∩ D ≠ ∅ for every vertex v in graph G . The domination number γ ( G ) is the minimum cardinality of a dominating set of G . The proximity π ( v ) of a vertex v is the average distance from it to all other vertices in graph. The remoteness ρ ( G ) of a connected graph G is the maximum proximity of all the vertices in graph G . AutoGraphiX Conjecture A.565 gives the sharp upper bound on the difference between the domination number and remoteness. In this paper, we characterize the explicit graphs that attain the upper bound in the above conjecture, and prove the improved AutoGraphiX conjecture.

Suggested Citation

  • Lidan Pei, 2022. "About AutoGraphiX Conjecture on Domination Number and Remoteness of Graphs," Mathematics, MDPI, vol. 10(19), pages 1-12, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3706-:d:937908
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3706/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3706/
    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:10:y:2022:i:19:p:3706-:d:937908. 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.