A Study on r-Configurations---A Resource Assignment Problem on Graphs

DOI10.1137/S0895480196311328MaRDI QIDQ4490782zbMATH OpenOpenAlexFDO

Authors Satoshi Fujita, Tiko Kameda, Masafumi Yamashita

Publication date 20 July 2000

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480196311328

zbMATH Keywords

cubic graphdominating setresource assignmentvertex labeling

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Mathematical problems of computer architecture (68M07) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2192159
• On the total domatic number of regular graphs
• Theoretical Computer Science
• The domatic number problem
• scientific article; zbMATH DE number 15376

Cited in

(7)

• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• Fractional domatic, idomatic, and total domatic numbers of a graph
• Common extremal graphs for three inequalities involving domination parameters
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Graphs with minimum fractional domatic number
• Loose cover of graphs
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

This page was built for publication: A Study on r-Configurations---A Resource Assignment Problem on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490782)