Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18692559

Restricted domination parameters in graphs

Author
GODDARD, Wayne1 ; HENNING, Michael A2
[1] Department of Computer Science, Clemson University, Clemson SC 29634, United States
[2] School of Mathematical Sciences, University of KwaZulu-Natal, Pietermaritzburg, 3209, South Africa
Source

Journal of combinatorial optimization. 2007, Vol 13, Num 4, pp 353-363, 11 p ; ref : 1/2 p

ISSN
1382-6905
Scientific domain
Control theory, operational research; Mathematics
Publisher
Springer, Norwell, MA
Publication country
United States
Document type
Article
Language
English
Author keyword
Domination number Double domination k-domination Restricted
Keyword (fr)
Ensemble dominant Optimisation combinatoire Sommet graphe Théorie graphe Vertex
Keyword (en)
Dominating set Combinatorial optimization Vertex(graph) Graph theory Vertex
Keyword (es)
Conjunto dominando Optimización combinatoria Vértice grafo Teoría grafo Vértice
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems

Discipline
Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
18692559

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

Access to the document

Searching the Web