Regular Tournaments with Minimum Split Domination Number and Cycle Extendability

Kim A. S. Factor; Larry J. Langley; Sarah K. Merz

doi:10.1007/978-3-031-05375-7_13

ScienceGate Book Chapters

BOOK-CHAPTER

Regular Tournaments with Minimum Split Domination Number and Cycle Extendability

Kim A. S. Factor Larry J. Langley Sarah K. Merz

Year: 2022 Springer proceedings in mathematics & statistics Pages: 171-182 Publisher: Springer International Publishing

DOI: 10.1007/978-3-031-05375-7_13

Get Full-Text PDF Get Analytical Report

Keywords:

Digraph Combinatorics Tournament Mathematics Dominating set Domination analysis Cardinality (data modeling) Upper and lower bounds Discrete mathematics Graph Computer science Vertex (graph theory)

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.36

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Game Theory and Applications

Social Sciences → Decision Sciences → Management Science and Operations Research

Game Theory and Voting Systems

Social Sciences → Economics, Econometrics and Finance → Economics and Econometrics

Auction Theory and Applications

Social Sciences → Decision Sciences → Management Science and Operations Research

Regular Tournaments with Minimum Split Domination Number and Cycle Extendability

Metrics

Topics

Related Documents

Cycle Extendability in Extended Tournaments

Domination graphs of regular tournaments

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments

Domination Number of Certain Infinite Tournaments

On the bounded domination number of tournaments