Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Gözüpek, Didem"'
Autor:
Gözüpek, Didem, Peterin, Iztok
A map $c:V(G)\rightarrow\{1,\dots,k\}$ of a graph $G$ is a packing $k$-coloring if every two different vertices of the same color $i\in \{1,\dots,k\}$ are at distance more than $i$. The packing chromatic number $\chi_{\rho}(G)$ of $G$ is the smallest
Externí odkaz:
http://arxiv.org/abs/2409.00697
Autor:
Gozupek, Didem.
Thesis (M.S.) -- New Jersey Institute of Technology, Dept. of Electrical and Computer Engineering, 2005.
Includes bibliographical references. Also available via the World Wide Web.
Includes bibliographical references. Also available via the World Wide Web.
Publikováno v:
In Discrete Applied Mathematics 30 January 2025 361:85-102
Autor:
Alizadeh, Hadi, Gözüpek, Didem
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23, no. 3, Graph Theory (December 16, 2021) dmtcs:7331
A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G
Externí odkaz:
http://arxiv.org/abs/2104.02446
A sequence of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v$ in the sequence has a neighbor which is adjacent to no vertex preceding $v$ in the sequence, and at the end every vertex of $G$
Externí odkaz:
http://arxiv.org/abs/2010.08368
A subset of vertices in a graph is called a total dominating set if every vertex of the graph is adjacent to at least one vertex of this set. A total dominating set is called minimal if it does not properly contain another total dominating set. In th
Externí odkaz:
http://arxiv.org/abs/2010.02341
Given a graph $G=(V(G), E(G))$, the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph $G$ are denoted by $\gamma(G)$, $\gamma_{\rm pr}(G)$, and $\gamma_{t}(G)$, respectively. For a positive
Externí odkaz:
http://arxiv.org/abs/1911.04098
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We investigate the ind
Externí odkaz:
http://arxiv.org/abs/1812.05316
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 77-94 (2023)
A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartit
Externí odkaz:
https://doaj.org/article/4244479f73db4f309ceab296561e6146
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1099-1117 (2022)
The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbo
Externí odkaz:
https://doaj.org/article/3349caaa23f74ec89a5a052f3497df5b