The aim of this article is to introduce the new notion on a given graph. The notions of valued set, valued function, valued graph and valued quotient are introduced. The attributes of these new notions are studied. Valued set is about the set of vertices which have the maximum number of neighbors. The kind of partition of the vertex set to the vertices of the valued set is introduced and its attributes are studied. The behaviors of classes of graphs under these new notions are studied and the algebraic operations on these sets in the different situations get new result to understand the classes of graphs, these notions and the general graphs better and more
The paper is concerned with dominating sets which arise naturally from a star partition of a finite ...
Let S ⊆ V be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) of S equals...
In this paper we introduce four graph theoretic parameters which just depend on the basic concept of...
In this paper, we define the notion of set-valuations of signed graphs and discuss certain propertie...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
In this article, some notions about set, weight of set, number, number’s position, special vertex ar...
In this paper we discuss the bounds of and relations among various kinds of intersection numbers of ...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
In this book authors for the first time introduce in a <br>systematic way the notion of complex valu...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
In this article, some notions about set, weight of set, number, number’s position, special vertex ar...
Abstract The main theme of this thesis is about Graph Coloring Applications and Defining Sets in Gr...
In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V ...
The paper is concerned with dominating sets which arise naturally from a star partition of a finite ...
Let S ⊆ V be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) of S equals...
In this paper we introduce four graph theoretic parameters which just depend on the basic concept of...
In this paper, we define the notion of set-valuations of signed graphs and discuss certain propertie...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
In this article, some notions about set, weight of set, number, number’s position, special vertex ar...
In this paper we discuss the bounds of and relations among various kinds of intersection numbers of ...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
In this book authors for the first time introduce in a <br>systematic way the notion of complex valu...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
In this article, some notions about set, weight of set, number, number’s position, special vertex ar...
Abstract The main theme of this thesis is about Graph Coloring Applications and Defining Sets in Gr...
In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V ...
The paper is concerned with dominating sets which arise naturally from a star partition of a finite ...
Let S ⊆ V be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) of S equals...
In this paper we introduce four graph theoretic parameters which just depend on the basic concept of...