Mostafa Blidia

According to our database1, Mostafa Blidia authored at least 36 papers between 1986 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Extremal graphs for a bound on the Roman domination number.
Discuss. Math. Graph Theory, 2020

2019
Some results on the <i>b</i>-chromatic number in complementary prism graphs.
RAIRO Oper. Res., 2019

On the k-domination number of digraphs.
J. Comb. Optim., 2019

Extremal digraphs for an upper bound on the Roman domination number.
J. Comb. Optim., 2019

2018
A characterization of edge b-critical graphs.
Discret. Appl. Math., 2018

2017
A new generalization of kernels in digraphs.
Discret. Appl. Math., 2017

2015
On edge-b-critical graphs.
Discret. Appl. Math., 2015

2014
Relations between the Roman k-domination and Roman domination numbers in graphs.
Discret. Math. Algorithms Appl., 2014

Bounds on the k-independence and k-chromatic numbers of graphs.
Ars Comb., 2014

On the k-independence number in graphs.
Australas. J Comb., 2014

2013
A characterization of trees for new lower bound on the <i> k</i>-independence number.
Discuss. Math. Graph Theory, 2013

ERRATUM to: Double domination edge removal critical graphs.
Australas. J Comb., 2013

Criticality indices of Roman domination of paths and cycles.
Australas. J Comb., 2013

2012
b-coloring of some bipartite graphs.
Australas. J Comb., 2012

2011
On sequences (γk) and (βk) in regular graphs.
Stud. Inform. Univ., 2011

A characterization of locating-total domination edge critical graphs.
Discuss. Math. Graph Theory, 2011

2010
Double domination edge removal critical graphs.
Australas. J Comb., 2010

Bounds on the domination number in oriented graphs.
Australas. J Comb., 2010

2009
On b-colorings in regular graphs.
Discret. Appl. Math., 2009

A characterization of locating-domination edge critical graphs.
Australas. J Comb., 2009

2008
Maximal k-independent sets in graphs.
Discuss. Math. Graph Theory, 2008

Extremal perfect graphs for a bound on the domination number.
Discret. Math., 2008

Locating-domination, 2-domination and independence in trees.
Australas. J Comb., 2008

2007
On k-independence in graphs with emphasis on trees.
Discret. Math., 2007

Locating-domination and identifying codes in trees.
Australas. J Comb., 2007

2006
Some bounds on the p-domination number in trees.
Discret. Math., 2006

Extremal graphs for a new upper bound on domination parameters in graphs.
Discret. Math., 2006

Characterizations of trees with equal paired and double domination numbers.
Discret. Math., 2006

2005
On the p-domination number of cactus graphs.
Discuss. Math. Graph Theory, 2005

On average lower independence and domination numbers in graphs.
Discret. Math., 2005

Independence and 2-domination in trees.
Australas. J Comb., 2005

1999
Some operations preserving the existence of kernels.
Discret. Math., 1999

1994
On the orientation of meyniel graphs.
J. Graph Theory, 1994

1993
On kernels in perfect graphs.
Comb., 1993

1992
Perfectly orderable graphs and almost all perfect graphs are kernel<i>M</i>-solvable.
Graphs Comb., 1992

1986
A parity diagraph has a kernel.
Comb., 1986


  Loading...