GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing mathworld.wolfram.com — Bruhat Graph -- from Wolfram MathWorld Bruhat Graph
The (weak) Bruhat graph Bruhat graphs are antipodal.
The permutations and edges corresponding to Special cases are summarized in the following table.
The See alsoCayley Graph, Transposition, Truncated Octahedral GraphExplore with Wolfram|AlphaReferencesAraki, T. and Kikuchi, Y. "Hamiltonian Laceability of Bubble-Sort Graphs with Edge Faults." Inform. Sci. 177, 2679-2691, 2007. https://doi.org/10.1016/j.ins.2007.01.017.Clancy, K.; Haythorpe, M.; and Newcombe, A. "An Effective Crossing Minimisation Heuristic Based on Star Insertion." J. Graph Algorithms Appl. 23, 135-166, 2019. https://doi.org/10.7155/jgaa.00487.House of Graphs. Bruhat Graphs. Singleton Graph, K2, C6, and Truncated Octahedral Graph.Hurlbert, G. "A Linear Optimization Technique for Graph Pebbling." 28 Jan 2011. https://arxiv.org/abs/1101.5641.Zheng, B.; Yang, Y.; and Xu, X. "An Upper Bound for the Crossing Number of Bubble-Sort GraphReferenced on Wolfram|AlphaBruhat GraphCite this as:Weisstein, Eric W. "Bruhat Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BruhatGraph.html Subject classifications |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |