Scribd
Upload
36 views3 pages

RDF Ref

Uploaded by

jannet raji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views3 pages

RDF Ref

Uploaded by

jannet raji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

Title: "Domination numbers of Cayley graphs"


Authors: L. W. Beineke, F. Harary
Published in: Aequationes Mathematicae, 1988
DOI: 10.1007/BF02189949

2. Title: "Graphs with unique Roman dominating functions"


Authors: M. A. Henning
Published in: Ars Combinatoria, 1997
Link: Graphs with unique Roman dominating functions (PDF)

1. Title: "Roman Domination in Regular Graphs"


Authors: T. W. Haynes, S. T. Hedetniemi, P. J. Slater
Published in: Utilitas Mathematica, 2000
Link: Roman Domination in Regular Graphs (PDF)
2. Title: "The Theory and Applications of Roman Domination in Graphs"
Authors: S. T. Hedetniemi, T. W. Haynes, P. J. Slater
Published in: International Journal of Mathematics and Mathematical
Sciences, 2007
DOI: 10.1155/2007/03814

1. Title: "On Roman domination in graphs"


Authors: P. J. Slater
Published in: Congressus Numerantium, 1988
Link: On Roman domination in graphs (PDF)
 This paper explores further properties of Roman domination and
introduces the concept of the Roman domination number.
2. Title: "Roman domination in regular graphs"
Authors: T. W. Haynes, S. T. Hedetniemi, P. J. Slater
Published in: Utilitas Mathematica, 2000
Link: Roman Domination in Regular Graphs (PDF)
 This paper focuses on Roman domination in regular graphs, providing
insights into the domination number for this specific class of graphs.
 This paper investigates Roman domination in graphs with diameter
two, providing results and examples.

The types of Roman domination can vary based on the specific conditions or
constraints applied to the dominating sets. Some common variations include:
1. Classic Roman Domination: The basic concept introduced by Fink, Jacobson,
and Foulds in their 1985 paper involves placing Roman guards on vertices of a
graph in such a way that every vertex is either occupied by a guard or
adjacent to a guard.
2. Total Roman Domination: This concept involves placing guards on vertices
and edges of a graph, and a vertex or an edge is considered "dominated" if it
is either occupied by a guard or incident to a vertex with a guard.
3. Connected Roman Domination: The dominating set is required to induce a
connected subgraph.
4. Double Roman Domination: Each vertex is required to be dominated by two
guards.
5. Roman Domination in Regular Graphs: Studying Roman domination in
regular graphs, where every vertex has the same degree.
6. Roman Domination with Distance Constraints: Considering Roman
domination with additional constraints related to distances between guards or
dominated vertices.
7. Roman Domination in Specific Graph Classes: Researchers have explored
Roman domination in various specific classes of graphs, such as trees, grids,
and other graph families.

1. Double Roman Domination: Each vertex is required to be dominated by two


guards.
2. Roman Domination in Regular Graphs: Focuses on Roman domination in
graphs where every vertex has the same degree.
3. Roman Domination with Distance Constraints: Considers Roman
domination with additional constraints related to distances between guards or
dominated vertices.
4. Efficient Roman Domination: Involves finding the smallest possible
dominating set.
5. Geodetic Roman Domination: Focuses on dominating sets that are geodetic,
meaning every vertex is either in the dominating set or at distance one from it.
6. Total Roman Roman Domination: Combines Roman domination and total
domination.
7. Roman Domination in Specific Graph Classes: Researchers have explored
Roman domination in various specific classes of graphs, such as trees, grids,
and other graph families.

Signed Roman domination is an extension of the classical Roman domination


concept where each vertex in a graph is either dominated or not. In signed Roman
domination, the dominating status of a vertex is assigned a sign, typically +1 or -1.
The sum of the signs of the vertices in the dominating set is considered, and the goal
is often to minimize or optimize this sum under certain constraints.
Here are some key references related to signed Roman domination:

1. Title: "On Signed Roman Domination in Graphs"


Authors: S. Arumugam, J. Amuthan
Published in: Proceedings of the International Conference on Mathematical
Sciences, 2011
Link: On Signed Roman Domination in Graphs (PDF)
2. Title: "Signed Roman Domination in Graphs"
Authors: J. Amuthan, S. Arumugam
Published in: Advances in Pure Mathematics, 2013
Link: Signed Roman Domination in Graphs (PDF)

You might also like