#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ramin Javadi, Zeinab Maleki, Behanz Omoomi
- 2012

A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k−clique covering is called local clique cover number of G and is denoted by lcc(G). Local clique cover number can be viewed as the local counterpart of the clique cover number which is… (More)

- Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
- Ars Comb.
- 2013

Let G = (V, E) be a graph. A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V − D has a neighbor in V − D. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number of G. In this paper, we define the concept of total restrained domination edge… (More)

- Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
- Ars Comb.
- 2013

- Zoltán Füredi, Zeinab Maleki
- Combinatorics, Probability & Computing
- 2017

- Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
- Journal of Graph Theory
- 2016

- Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
- Graphs and Combinatorics
- 2013

Let G be a graph with vertex set V. A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V \ D has a neighbor in V \ D. The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γ tr (G). In this paper, we prove that… (More)

- ‹
- 1
- ›