IDEAS home Printed from https://ideas.repec.org/a/hin/jijmms/465164.html
   My bibliography  Save this article

Bridge and cycle degrees of vertices of graphs

Author

Listed:
  • Gary Chartrand
  • Farrokh Saba
  • Nicholas C. Wormald

Abstract

The bridge degree bdeg v and cycle degree cdeg v of a vertex v in a graph G are, respectively, the number of bridges and number of cycle edges incident with v in G . A characterization of finite nonempty sets S of nonnegative integers is given for which S is the set of bridge degrees (cycle degrees) of the vertices of some graph. The bridge-cycle degree of a vertex v in a graph G is the ordered pair ( b , c ) , where bdeg v = b and cdeg v = c . Those finite sets S of ordered pairs of nonnegative integers for which S is the set of bridge-cycle degrees of the vertices of some graph are also characterized.

Suggested Citation

  • Gary Chartrand & Farrokh Saba & Nicholas C. Wormald, 1984. "Bridge and cycle degrees of vertices of graphs," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 7, pages 1-10, January.
    • Handle: RePEc:hin:jijmms:465164
    DOI: 10.1155/S0161171284000375
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJMMS/7/465164.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/IJMMS/7/465164.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/S0161171284000375?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jijmms:465164. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.