-
4461
Quadruple Roman Domination in Trees
Published 2021-07-01“…This paper is devoted to the study of the quadruple Roman domination in trees, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. …”
Get full text
Article -
4462
-
4463
From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs
Published 2021-07-01“…This paper is devoted to the study of the strongly total Roman domination number of a graph and it is a contribution to the Special Issue “Theoretical Computer Science and Discrete Mathematics” of Symmetry. …”
Get full text
Article -
4464
18.218 Probabilistic Method in Combinatorics, Spring 2019
Published 2023“…This course is a graduate-level introduction to the probabilistic method, a fundamental and powerful technique in combinatorics and theoretical computer science. The essence of the approach is to show that some combinatorial object exists and prove that a certain random construction works with positive probability. …”
Get full text
-
4465
From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs
Published 2021-06-01“…This paper is devoted to the study of the quasi-total strong differential of a graph, and it is a contribution to the Special Issue “<i>Theoretical computer science and discrete mathematics</i>” of <i>Symmetry</i>. …”
Get full text
Article -
4466
26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3
Published 2017-08-01Get full text
Article -
4467
-
4468
Theoretical Systematics in Testing the Cosmological Principle with the Kinematic Quasar Dipole
Published 2023-01-01Get full text
Article