Treffer: Total domination number of the conjunction of graphs
Title:
Total domination number of the conjunction of graphs
Authors:
Source:
Cycles and colourings 2003Discrete mathematics. 307(7-8):1016-1020
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 3 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Conjonction graphes, Conjunction of graphs, Nombre domination totale, Total domination number
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Mathematics, Technical University of Szczecin, al. Piastów 48/49, 70-310 Szczeci, Poland
ISSN:
0012-365X
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.18531369
Database:
PASCAL Archive
Weitere Informationen
In this paper we discuss the total domination number with respect to the conjunction of two graphs. We estimate the total domination number of the conjunction G A H, showing that γt (G A H) ≤γt (G)γt (H), for graphs having no isolated vertices. Additionally, we show that for G ≅ Pn or for G and H having the domination number equal to half their orders, the equality is attained.