Curling number of rooted product of general graphs
Curling number of rooted product of general graphs
- 장전수학회
- Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)
- 23(2)
-
2020.04209 - 222 (14 pages)
- 0
A curling subsequence is a maximal subsequence C of the degree sequence of a simple connected graph G for which the curling number cn(G) corresponds to the curling number of the degree sequence and hence the curling number of the graph G. The curling number of a graph G may be defined as the number of times an element in the degree sequence of G appears the most and compound curling number of G is the product of multiplicities of the degrees of vertices in G. In this paper we establish the bounds for curling number and find Compound curling number of rooted product graph GoH.
A curling subsequence is a maximal subsequence C of the degree sequence of a simple connected graph G for which the curling number cn(G) corresponds to the curling number of the degree sequence and hence the curling number of the graph G. The curling number of a graph G may be defined as the number of times an element in the degree sequence of G appears the most and compound curling number of G is the product of multiplicities of the degrees of vertices in G. In this paper we establish the bounds for curling number and find Compound curling number of rooted product graph GoH.
(0)
(0)