Linear election in pancake graphs

DOI10.1016/J.IPL.2007.10.017zbMATH Open1186.68555OpenAlexW2030787951MaRDI QIDQ963349FDOQ963349

Authors: Adnan Mohamed, R. S. Ramakrishna 

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.017

Recommendations

• scientific article; zbMATH DE number 4045787
• On pancyclic line graphs
• scientific article; zbMATH DE number 1187419
• Linear choosability of graphs
• Linear choosability of graphs
• scientific article; zbMATH DE number 1150151
• Pancyclic graphs and linear forests
• On circuits and pancyclic line graphs
• Pancyclic and panconnected line graphs
• scientific article; zbMATH DE number 2087429

zbMATH Keywords

algorithmsdistributed algorithmsinterconnection networkspancake graphelection

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• A group-theoretic model for symmetric interconnection networks
• Distributed match-making
• Title not available (Why is that?)

Cited In (3)

• Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
• Leader election in oriented star graphs
• A comparative study of job allocation and migration in the pancake network

This page was built for publication: Linear election in pancake graphs

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