Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Ghebleh, M."'
Autor:
Ghebleh, M., Mahmoodian, E. S.
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver coloring. Total
Externí odkaz:
http://arxiv.org/abs/1302.2986
Autor:
Ghebleh, M., Niepel, L.
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words, S is dominating if the sets S\cap N[u] where u \in V(G) and N[u] denotes the closed neighbourhood of u in G, a
Externí odkaz:
http://arxiv.org/abs/1207.4660
Autor:
Kanso, A., Ghebleh, M.
Publikováno v:
In Journal of Visual Communication and Image Representation October 2018 56:245-255
Publikováno v:
Discrete Appl. Math. 119 (2002), no. 3, 217--225
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which c
Externí odkaz:
http://arxiv.org/abs/math/9906187
Autor:
Ghebleh, M., Mahmoodian, E. S.
Publikováno v:
Ars Combinatoria 59 (2001), 307-318
Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. Recen
Externí odkaz:
http://arxiv.org/abs/math/9906009
Autor:
Ghebleh, M., Khoeilar, R.
Publikováno v:
Bulletin of the Institute of Combinatorics and its Applications 31 (2001), 60-68
The concept of an H-cordial graph is introduced by I. Cahit in 1996 (Bulletin of the ICA). But that paper has some gaps and invalid statements. We try to prove the statements whose proofs in Cahit's paper have problems, and also we give counterexampl
Externí odkaz:
http://arxiv.org/abs/math/9906012
Publikováno v:
Journal of Combinatorial Mathematics and Combinatorial Computing 41 (2002), 151-160
In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list coloring. The minimum k for which G is not uniquely k-list colorable is call
Externí odkaz:
http://arxiv.org/abs/math/9906011
Autor:
Kanso, A., Ghebleh, M.
Publikováno v:
In Optics and Lasers in Engineering March 2017 90:196-208
Publikováno v:
In Applied Mathematics and Computation 30 April 2016 281:130-136
Autor:
Kanso, A., Ghebleh, M.
Publikováno v:
In Communications in Nonlinear Science and Numerical Simulation July 2015 24(1-3):98-116