Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Spectrum of Intelligent Tourist Destination Image Decision Information System Read chapter Read first chapter

2022 | OriginalPaper | Chapter

General Characterization of at Most Twin Outer Perfect Domination Number with Colouring of Graphs

Author : G. Mahadevan

Published in: Mathematical, Computational Intelligence and Engineering Approaches for Tourism, Agriculture and Healthcare

Publisher: Springer Singapore

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Recently, the concept At most twin outer perfect domination number of a graph was introduced by Mahadevan et.al in (Int J Pure Appl Math 117(13):109–116, 2017). A set \(S \subseteq V\left( G \right)\) in a graph G is said to be an at most twin outer perfect dominating set in G, if for every vertex \(v \in V - S\),\(1 \le \left| {N\left( V \right) \cap S} \right| \le 2 and\left\langle {V - S} \right\rangle\) and has at least one perfect matching. The minimum cardinality of at most twin outer perfect dominating sets is called the At most twin outer perfect domination number and is denoted by \(\gamma_{atop} \left( G \right).\) In this paper, we characterize all graphs, for colouring, with At most Twin outer perfect domination number 2n-5 and 2n-6 for n ≥ 4.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
previous chapter Space-Time Admitting -Curvature Tensor
next chapter Computing Modelling of Quotient Supra Spaces
Literature
1.
Harary, F.: Graph Theory. Addison Wesley Reading Mass (1972)
2.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: At most twin outer perfect domination and colouring of a graph. Int. J. Pure Appl. Math. 117(13), 109–116 (2017)
3.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: At most twin outer perfect domination and colouring of a graph. Accepted for publication in the Int. J. Pure Appl. Math. (2018)
4.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: Characterization of chromatic number with complementary connected perfect domination number of a graph. Int. J. Appl. Eng. Res. 10(92), 404–409 (2015)
5.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: Further results on chromatic number with complementary connected perfect domination number of a graph. Int. J. Eng. Sci. Adv. Comput. Bio Technol. 8(1), 17–23 (2017)
6.
Mahadevan, G., Avadayappan, S., Joseph, J.P., Ayisha, B., Subramanian, T.: Complementary triple connected domination number of a graph. Int. J. Adv. Appl. Discret. Math. 12, 39–54 (2013)
7.
Mahadevan, G.S., Bibi, A.M. (2013) A Complementary perfect triple connected domination number of a graph. Int. J. Eng. Res. Appl. 2, 260–265 (2013)
8.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: Complementary connected perfect domination number of a graph, International Journal of pure and Applied Mathematics, Vol. 106 , pp 17–24, (2016).
9.
Mahadevan, G., Basira, A.I., Sivagnanam, C.: Characterization of chromatic number with complementary connected perfect domination number of a graph. Int. Organ. Sci. Res. Dev. 10, 404 – 410 (2016)
10.
Mustapha, C. et al.: [1,2] sets in graphs. Discret. Appl. Math. 161 2885–2893 (2013)
11.
Joseph J.P., Mahadevan, G., Selvam, A.: On complementary perfect domination number of a graph. Acta Ciencia Indica XXXI M(2), 846–854 (2006)
12.
Joseph J.P., Arumugam, S.: Domination and colouring in graphs. Int. J. Manag. Syst. 8(1), 37–44 (1997)
13.
Haynes, W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)MATH
14.
Yang, X., Baoyindureng, Wu.: [1, 2]-domination in graphs. Discret. Appl. Math. 175, 79–86 (2014)CrossRef
Metadata
Title
General Characterization of at Most Twin Outer Perfect Domination Number with Colouring of Graphs
Author
G. Mahadevan
Copyright Year
2022
Publisher
Springer Singapore
Book
Mathematical, Computational Intelligence and Engineering Approaches for Tourism, Agriculture and Healthcare

Print ISBN: 978-981-16-3806-0

Electronic ISBN: 978-981-16-3807-7

Copyright Year: 2022

DOI
https://doi.org/10.1007/978-981-16-3807-7_13

Premium Partners

    Image Credits