• No results found

[PDF] Top 20 Clique Transversal Domination of a Graph

Has 10000 "Clique Transversal Domination of a Graph" found on our website. Below are the top 20 most common "Clique Transversal Domination of a Graph".

Clique Transversal Domination of a Graph

Clique Transversal Domination of a Graph

... that is complete. Note that we do not require the clique to be maximal under inclusion. A set of vertices such that none of them are adjacent is known as an independent set. The maximum cardinality of an ... See full document

6

Changing And Unchanging Properties Of Single Chromatic Transversal Domination Number Of Graphs

Changing And Unchanging Properties Of Single Chromatic Transversal Domination Number Of Graphs

... the domination number of a graph and is denoted by γ ...chromatic transversal dominating set if D intersects every member (color class) of some chromatic partition, also called χ-partition of ... See full document

5

THE INDEPENDENT TRANSVERSAL PAIRED DOMINATION IN GRAPHS

THE INDEPENDENT TRANSVERSAL PAIRED DOMINATION IN GRAPHS

... independent transversal paired domination instead of domination alone or any other type of domination and call this partition an independent transversal paired domatic ...independent ... See full document

15

A Review on Relation between Dominating and Total Dominating Color Transversal Number of Graph and Monotonicity

A Review on Relation between Dominating and Total Dominating Color Transversal Number of Graph and Monotonicity

... – Domination is a very fast developing area in Graph ...of domination, total domination, proper colouring and transversal ...the domination transversal number for ... See full document

5

Some graph parameters on the composite order Cayley graph

Some graph parameters on the composite order Cayley graph

... Cayley graph is in- ...Some graph parame- ters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order ... See full document

8

Distance Patterns in Structural Similarity

Distance Patterns in Structural Similarity

... best graph approximation since the assignment problem is only an approximative encoding for best graph approximation problem) can be found by any weighted assignment algorithm for bipartite ...smaller ... See full document

22

Domination defect in graphs: Guarding with fewer guards 

Domination defect in graphs: Guarding with fewer guards 

... Let G be a graph with vertex set V = V (G) and edge set E = E(G). We will denote the order of G as |V | or |V (G)| depending on the context. The open neighborhood of a vertex v ∈ V is N (v) = {u ∈ V | uv ∈ E}, and ... See full document

16

Comparison of Efficient Domination Number with Domination Number, Roman Domination Number and Chromatic Number of a Graph

Comparison of Efficient Domination Number with Domination Number, Roman Domination Number and Chromatic Number of a Graph

... Graph theory is branch of mathematics, which has becomes quite rich and interesting for several ...in graph theory. There are several areas in graph theory which have reserved good attention from ... See full document

8

Collective Inference for  Extraction MRFs Coupled with Symmetric Clique Potentials

Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials

... Recently, two inference frameworks, the LP relaxation of Werner (2008) and the dual-decomposition framework of Komodakis and Paragios (2009) have been extended to handle higher-order potentials. In the LP relaxation ... See full document

39

The conjugate graph and conjugacy class graph of order at most 32

The conjugate graph and conjugacy class graph of order at most 32

... conjugate graph of 𝐺 , α 𝐺 b) The chromatic number of conjugate graph of 𝐺 , 𝐺 c) The clique number of conjugate graph of 𝐺 , 𝐺 d) The dominating number of conjugate graph of 𝐺 , γ 𝐺 ... See full document

9

Degree Equitable Domination Number and Independent Domination Number of a Graph

Degree Equitable Domination Number and Independent Domination Number of a Graph

... a graph G is called a component of G ...the graph with vertex set V in which two vertices are adjacent iff they are not adjacent in ...acyclic graph. A bipartite graph is a graph whose ... See full document

5

Triple Domination Number of a Butterfly Graph

Triple Domination Number of a Butterfly Graph

... By the symmetric structure of BF(n), the domination number must be even. Therefore │S│ is even. Suppose │ S│= 14. Then by symmetry 7 vertices in the left copy and 7 vertices in the right copy are selected. But as ... See full document

5

The Split Majority Domination Number of a Graph

The Split Majority Domination Number of a Graph

... In this article, we have extended the notion of majority dominating set D of a graph G to its complement V-D such that <V-D> is disconnected. We have characterized some theorems for a majority dominating set ... See full document

10

Bounds for Domination Parameters in Cayley Graphs on Dihedral Group

Bounds for Domination Parameters in Cayley Graphs on Dihedral Group

... the graph G = (V, E), where V(G) = Γ and E(G)={(x, xa) x  V(G), a  Ω} and it is denoted by G = Cay(Γ, ...a graph G is called a dominating set if every vertex v  V is either an element ... See full document

6

Edge Domination in the Shadow Distance Graph of Some Star Related Graphs

Edge Domination in the Shadow Distance Graph of Some Star Related Graphs

... adjacent to some vertex in . S The domination number of G denoted by γ (G ) is the minimal cardinality taken over all dominating sets of G A subset F of E is called an . edge dominating set if each edge in E is ... See full document

8

The Disjoint Total Domination Number of a Graph

The Disjoint Total Domination Number of a Graph

... the closed neighborhood of S is N[S] = N(S) ∪ S. A set D ⊆ V is a dominating set if every vertex in V – D adjacent to a vertex in D, that is N[D] = V. The domination number γ(G) of G is the minimum cardinality of ... See full document

6

Strong Complementary Acyclic Domination of a Graph

Strong Complementary Acyclic Domination of a Graph

... a graph G, denoted by χ (G ) is the minimum number of colors needed to color all the vertices a graph G in which adjacent vertices receive distinct ...a graph and its ... See full document

7

Comparison of Roman Domination Number with Domination Number, Independent Domination Number and Chromatic Number of a Graph

Comparison of Roman Domination Number with Domination Number, Independent Domination Number and Chromatic Number of a Graph

... 2) Proof: Roman Emperor Constantine had the requirement that an army or legion could be sent from its home to defend a neighboring location only if there was a second army, which would stay and protect the home. Thus, ... See full document

7

On exponential domination and graph operations

On exponential domination and graph operations

... Let G = (V (G), E(G)) be a simple undirected graph of order n. We begin by recalling some standard definitions that we need throughout this paper. For any vertex v ∈ V (G), the open neighborhood of v is N (v) = {u ... See full document

8

Split and Equitable Domination of Some Special Graph

Split and Equitable Domination of Some Special Graph

... equitable domination in graphs, by considering the following real world problems like : in a network nodes with nearly equal capacity may interact with each other in a better way, in this society persons with ... See full document

5

Show all 10000 documents...