N. K.Sudev, K. A. Germina, K. P. Chithra
Abstract
Open-access reader
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f :In this paper, the characteristics and properties of strong integer additive set-labeled graphs are critically and creatively reviewed.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f :In this paper, the characteristics and properties of strong integer additive set-labeled graphs are critically and creatively reviewed.
Key concepts: Power set, Injective function, Combinatorics, Graph, Integer (computer science), Mathematics, Discrete mathematics, Set (abstract data type)