On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
William F. Klostermeyer, Gary MacGillivray (2017)
Discussiones Mathematicae Graph Theory
Similarity:
We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached. The study of the stronger assertion that such a set can be reached after a single attack is defended leads to the study of graphs which are critical in the sense that deleting any vertex reduces the eternal domination number. Examples of these graphs...
José D. Alvarado, Simone Dantas, Dieter Rautenbach (2017)
Discussiones Mathematicae Graph Theory
Similarity:
For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013) 806-812] present some kind of characterization of the graphs G for which R(G) − yr2(G) = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize...
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...
Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.
Mieczysław Borowiecki, Danuta Michalak, Elżbieta Sidorowicz (1997)
Discussiones Mathematicae Graph Theory
Similarity:
The purpose of this paper is to present some basic properties of 𝓟-dominating, 𝓟-independent, and 𝓟-irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.
Igor' E. Zverovich, Olga I. Zverovich (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Curtin, Eugen (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jerzy Topp
Similarity:
CONTENTS1. Introduction........................................................................................................ 5 1.1. Purpose and scope................................................................................. 5 1.2. Basic graphtheoretical terms................................................................ 62. Domination, independence and irredundance in graphs................................ 9 2.1. Introduction and preliminaries.................................................................
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Mieczysław Borowiecki, Anna Fiedorowicz (2006)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper a concept 𝓠-Ramsey Class of graphs is introduced, where 𝓠 is a class of bipartite graphs. It is a generalization of well-known concept of Ramsey Class of graphs. Some 𝓠-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that 𝓣₂, the class of all outerplanar graphs, is not 𝓓₁-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds for a hereditary property 𝓟 . For 𝓣₂ we found two bounds (Theorem 4). An improvement,...