Learn More
called a distance magic labeling of G if there exists a positive integer k such that u∈N (v) f (u) = k for al v ∈ V , where N (v) is the open neighborhood of v. The constant k is called the magic constant of labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. In this paper we present a survey of existing results on(More)
Let G be a (p, q)-graph with edge domination number γ and edge domatic number d. In this paper we characterize connected graphs for which γ = p/2 and graphs for which γ + d = q + 1. We also characterize trees and unicyclic graphs for which γ = p/2 and γ = q − ∆ , where ∆ denotes the maximum degree of an edge in G.
Let G = (V, E) be a graph without isolated vertices. A dominating set S of G is called a neighbourhood total dominating set (ntd-set) if the induced subgraph N (S) has no isolated vertices. The minimum cardinality of a ntd-set of G is called the neighbourhood total domination number of G and is denoted by γnt(G). The maximum order of a partition of V into(More)
The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir ≤ γ ≤ i ≤ β0 ≤ Γ ≤ IR where ir, IR are the irredundance and upper irredundance numbers, γ, Γ are the domination and upper domination numbers and i, β0 are the independent domination number and independence number respectively. In this(More)
Texture discrimination is playing a vital role in a real world image classification and object identification in a content based image retrieval (CBIR) system. For discriminating the textures, exact features have to be extracted. Although there are many techniques available they are not capable of classifying the universal textures because of their inherent(More)