JTJerzy Topp
Jerzy Topp
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jerzy Topp has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Paweł Żyliński
University of Gdansk, Gdansk, Poland
11 shared publications - Magda Dettlaff
Faculty of Applied Physics and Mathematics, Gdańsk University of Technology, Gdańsk, Poland
10 shared publications - Michael A. Henning
Department of Mathematics and Applied Mathematics University of Johannesburg Auckland Park South Africa
9 shared publications Lutz Volkmann
6 shared publications- Mateusz Miotk
University of Gdansk, Gdansk, Poland
6 shared publications - Magdalena Lemańska
Gdansk University of Technology
4 shared publications
Latest Publications
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (4) , 1345
On total domination subdivision numbers of trees
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (4) , 1345
On total domination subdivision numbers of trees
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (1) , 67
Characterization of \alpha-excellent 2-trees
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (1) , 67
Characterization of \alpha-excellent 2-trees
- Open Access
On total domination subdivision numbers of trees
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $γ_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total domination subdivision number $\mbox{sd}_{γ_t}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where each edge in $G$ can be subdivided at most once) in order to increase the total domination number. Haynes et al. (Discrete Math. 286 (2004) 195--202) have given a constructive characterization of trees whose total domination subdivision number is~$3$. In this paper, we give new characterizations of trees whose total domination subdivision number is 3.Open AccessOn total domination subdivision numbers of trees
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $γ_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total domination subdivision number $\mbox{sd}_{γ_t}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where each edge in $G$ can be subdivided at most once) in order to increase the total domination number. Haynes et al. (Discrete Math. 286 (2004) 195--202) have given a constructive characterization of trees whose total domination subdivision number is~$3$. In this paper, we give new characterizations of trees whose total domination subdivision number is 3. - Open Access
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (1) , 47-74
Minimal graphs with disjoint dominating and total dominating sets
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (1) , 47-74
Open AccessMinimal graphs with disjoint dominating and total dominating sets
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 253-259
Common domination perfect graphs
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 253-259
Common domination perfect graphs
- Open Access
- 16 January 2023
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (2) , 1-16
On $\alpha $-Excellent GraphsA graph G is $$\alpha $$ -excellent if every vertex of G is contained in some maximum independent set of G. In this paper, we characterize $$\alpha $$ -excellent bipartite graphs, $$\alpha $$ -excellent unicyclic graphs, $$\alpha $$ -excellent simplicial graphs, $$\alpha $$ -excellent chordal graphs, $$\alpha $$ -excellent block graphs, and we show that every generalized Petersen graph is $$\alpha $$ -excellent.- 16 January 2023
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (2) , 1-16
Open AccessOn $\alpha $-Excellent GraphsA graph G is $$\alpha $$ -excellent if every vertex of G is contained in some maximum independent set of G. In this paper, we characterize $$\alpha $$ -excellent bipartite graphs, $$\alpha $$ -excellent unicyclic graphs, $$\alpha $$ -excellent simplicial graphs, $$\alpha $$ -excellent chordal graphs, $$\alpha $$ -excellent block graphs, and we show that every generalized Petersen graph is $$\alpha $$ -excellent. - Open Access
Graphs with disjoint 2-dominating sets
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a vertex or vertices in $D$. A graph $G$ is a $(2,2)$-dominated graph if it has a pair $(D,D')$ of disjoint $2$-dominating sets of vertices of $G$. In this paper we present two characterizations of minimal $(2,2)$-dominated graphs.Open AccessGraphs with disjoint 2-dominating sets
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a vertex or vertices in $D$. A graph $G$ is a $(2,2)$-dominated graph if it has a pair $(D,D')$ of disjoint $2$-dominating sets of vertices of $G$. In this paper we present two characterizations of minimal $(2,2)$-dominated graphs. - Open Access
Common Independence in Graphs
The cardinality of a largest independent set of G, denoted by , is called the independence number of G. The independent domination number of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by , as the greatest integer r such that every vertex of G belongs to some independent subset X of with . The common independence number of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality in G, and there are vertices in G that do not belong to any larger independent set in G. For any graph G, the relations between above parameters are given by the chain of inequalities . In this paper, we characterize the trees T for which , and the block graphs G for which .Open AccessCommon Independence in Graphs
The cardinality of a largest independent set of G, denoted by , is called the independence number of G. The independent domination number of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by , as the greatest integer r such that every vertex of G belongs to some independent subset X of with . The common independence number of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality in G, and there are vertices in G that do not belong to any larger independent set in G. For any graph G, the relations between above parameters are given by the chain of inequalities . In this paper, we characterize the trees T for which , and the block graphs G for which . - Open Access
Minimal graphs with disjoint dominating and total dominating sets
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we study further properties of DTDP-graphs and, in particular, we characterize minimal DTDP-gaphs without loops.Open AccessMinimal graphs with disjoint dominating and total dominating sets
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we study further properties of DTDP-graphs and, in particular, we characterize minimal DTDP-gaphs without loops. - 1 February 2020
- Published by Elsevier in Discrete Optimization
- Vol. 35
Disjoint dominating and 2-dominating sets in graphs
- 1 February 2020
- Published by Elsevier in Discrete Optimization
- Vol. 35
Disjoint dominating and 2-dominating sets in graphs