Authors: G. Bacsó and Zs. Tuza
View More View Less
  • 1 Köztársaság Tér 1 H-1081 Budapest Hungary Köztársaság Tér 1 H-1081 Budapest Hungary
  • | 2 Institute Hungarian Academy of Sciences Computer and Automation Kende U. 13-17 H-1111 Budapest Hungary Kende U. 13-17 H-1111 Budapest Hungary
Restricted access

Abstract  

All induced connected subgraphs of a graphG contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices inG. Moreover, the problem of finding any given type of connected dominating sets in all members of a classG of graphs can be reduced to the graphsGG that have a cut-vertex or do not contain any cutsetS dominated by somes∈S.

Manuscript Submission: HERE

  • Impact Factor (2019): 0.693
  • Scimago Journal Rank (2019): 0.412
  • SJR Hirsch-Index (2019): 20
  • SJR Quartile Score (2019): Q3 Mathematics (miscellaneous)
  • Impact Factor (2018): 0.664
  • Scimago Journal Rank (2018): 0.412
  • SJR Hirsch-Index (2018): 19
  • SJR Quartile Score (2018): Q2 Mathematics (miscellaneous)

Periodica Mathematica Hungarica
Language English
Size B5
Year of
Foundation
1971
Volumes
per Year
2
Issues
per Year
4
Founder Bolyai János Matematikai Társulat - János Bolyai Mathematical Society
Founder's
Address
H-1055 Budapest, Hungary Falk Miksa u. 12.I/4.
Publisher Akadémiai Kiadó
Springer Nature Switzerland AG
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0031-5303 (Print)
ISSN 1588-2829 (Online)