Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

Lemanska, Magdalena; Rodríguez-Velázquez, Alberto; Trujillo Rasua, Rolando

doi:10.3233/FI-2017-1520

Available on ORBilu since
17 May 2017

Article (Scientific journals)

Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

Lemanska, Magdalena; Rodríguez-Velázquez, Alberto; Trujillo Rasua, Rolando

2017 • In Fundamenta Informaticae, 152 (3), p. 273-287

Peer Reviewed verified by ORBi

Permalink
https://hdl.handle.net/10993/31192

DOI
10.3233/FI-2017-1520

Files Send to Details Statistics Bibliography Similar publications

Files

Full Text

LRT2017.pdf

Author preprint (316.43 kB)

All documents in ORBilu are protected by a user license.

Send to

RIS BibTex APA Chicago Permalink Twitter Linkedin

Details

Keywords :

vertex cover; domination

Disciplines :

Mathematics
Computer science

Author, co-author :

Lemanska, Magdalena

Rodríguez-Velázquez, Alberto

Trujillo Rasua, Rolando ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)

External co-authors :

yes

Language :

English

Title :

Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

Publication date :

2017

Journal title :

Fundamenta Informaticae

ISSN :

0169-2968

Publisher :

IOS Press

Volume :

152

Issue :

Pages :

273-287

Peer reviewed :

Peer Reviewed verified by ORBi

Focus Area :

Security, Reliability and Trust
Computational Sciences

Statistics

Number of views

123 (32 by Unilu)

Number of downloads

0 (0 by Unilu)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

WoS citations^™