“…The motivation for the concept of sum signed labeling arose from the above idea that the vehicles passing through a road are sometimes restricted in terms of width of the road from a smooth, continuous ride. Introductory studies on sum signed graphs is available in [7]. In this paper, we extend the studies on sum signed graphs.…”
Section: Introductionmentioning
confidence: 92%
“…Definition 2 [7]. The smallest number of negative edges among all sum signed labeling of its underlying graph G is called the rna number.…”
Section: Preliminariesmentioning
confidence: 99%
“…Thus, there exists only one sum signed labeling of the graph. For n = 3, the number of negative edges in K 3 is 2 as given [7]. When n ≥ 4, the minimum size of cycle present in K n is that of 3.…”
Section: Balanced Sum Signed Graphsmentioning
confidence: 99%
“…The concept of rna number in parity signed graphs was introduced in [2] and was studied in [3]. In [7], the rna number of sum signed graphs was introduced and has been found for various types of graphs. Here, the concept will be generalized in particular for acyclic graphs.…”
Section: Algorithm For Rna Number Of a Treementioning
In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of \(rna\) number is revisited and an important relation between the number and its complement is established.
“…The motivation for the concept of sum signed labeling arose from the above idea that the vehicles passing through a road are sometimes restricted in terms of width of the road from a smooth, continuous ride. Introductory studies on sum signed graphs is available in [7]. In this paper, we extend the studies on sum signed graphs.…”
Section: Introductionmentioning
confidence: 92%
“…Definition 2 [7]. The smallest number of negative edges among all sum signed labeling of its underlying graph G is called the rna number.…”
Section: Preliminariesmentioning
confidence: 99%
“…Thus, there exists only one sum signed labeling of the graph. For n = 3, the number of negative edges in K 3 is 2 as given [7]. When n ≥ 4, the minimum size of cycle present in K n is that of 3.…”
Section: Balanced Sum Signed Graphsmentioning
confidence: 99%
“…The concept of rna number in parity signed graphs was introduced in [2] and was studied in [3]. In [7], the rna number of sum signed graphs was introduced and has been found for various types of graphs. Here, the concept will be generalized in particular for acyclic graphs.…”
Section: Algorithm For Rna Number Of a Treementioning
In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of \(rna\) number is revisited and an important relation between the number and its complement is established.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.