Seating rearrangements on arbitrary graphs

DOI10.2140/INVOLVE.2014.7.787MaRDI QIDQ2513729zbMATH OpenOpenAlexWikidataFDO

Authors Daryl Deford

Publication date 28 January 2015

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2014.7.787

zbMATH Keywords

cycle coversmatrix permanentsrecurrence relationstilings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Counting rearrangements on generalized wheel graphs
• The 2 n seating derangements
• Random unfriendly seating arrangement in a dining table
• Weighted de Bruijn graphs for the menage problem and its generalizations
• Optimum seating arrangements and Tuscan squares.

Cited in

(8)

• Random unfriendly seating arrangement in a dining table
• Buses, bullies, and bijections
• The 2 n seating derangements
• Seat arrangement problems
• Stirling numbers of the first kind for graphs
• Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
• Ranking trees based on global centrality measures
• Labeled graph rearrangements on matched and star products

This page was built for publication: Seating rearrangements on arbitrary graphs

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