Bridge and cycle degrees of vertices of graphs
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)...
Saved in:
Main Authors: | Gary Chartrand, Farrokh Saba, Nicholas C. Wormald |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1984-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171284000375 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Exploration Degree Bias: The Hidden Influence of Node Degree in Graph Neural Network-Based Reinforcement Learning
by: Peter Tarabek, et al.
Published: (2025-01-01) -
Scientific and Professional Degrees in Russia: Developing Traditions into the Future
by: A. I. Rudskoy, et al.
Published: (2022-12-01) -
Leaving Before Completing: How Course Withdrawal Predicts College Student Success
by: Ibrahim Bicak, et al.
Published: (2024-12-01) -
The ordinal of dynamical degrees of birational maps of the projective plane
by: Bot, Anna
Published: (2024-03-01) -
Bridges and Men/
by: Gies,Joseph
Published: (1963)