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
-
Phosphate rebinding induces force reversal via slow backward cycling of cross-bridges
by: Robert Stehle
Published: (2025-01-01) -
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) -
Risk-based bridge life cycle cost and environmental impact assessment considering climate change effects
by: Sang Hyeon Lee, et al.
Published: (2025-01-01) -
Weighted evidence combination based on degree of credibility and certainty
by: Lu WANG, et al.
Published: (2017-01-01) -
Effect of superheat degree on the performance of an organic Rankine cycle system that utilizes a wet working fluid
by: Jui‐C. Hsieh, et al.
Published: (2024-11-01)