Displaying similar documents to “Domination parameters of a graph with deleted special subset of edges”

Paired-domination

S. Fitzpatrick, B. Hartnell (1998)

Discussiones Mathematicae Graph Theory

Similarity:

We are interested in dominating sets (of vertices) with the additional property that the vertices in the dominating set can be paired or matched via existing edges in the graph. This could model the situation of guards or police where each has a partner or backup. This paper will focus on those graphs in which the number of matched pairs of a minimum dominating set of this type equals the size of some maximal matching in the graph. In particular, we characterize the leafless graphs of...

Survey of certain valuations of graphs

Martin Bača, J.A. MacDougall, Mirka Miller, Slamin, W.D. Wallis (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.