Gray graph

In the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three edges. It was discovered by Marion C. Gray in 1932 (unpublished), then discovered independently by Bouwer 1968 in reply to a question posed by Jon Folkman 1967. The Gray graph is interesting as the first known example of a cubic graph having the algebraic property of being edge but not vertex transitive (see below).

单词	Gray graph
释义	Gray graph 英语百科 Gray graph In the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three edges. It was discovered by Marion C. Gray in 1932 (unpublished), then discovered independently by Bouwer 1968 in reply to a question posed by Jon Folkman 1967. The Gray graph is interesting as the first known example of a cubic graph having the algebraic property of being edge but not vertex transitive (see below).
随便看	mannosylglycoprotein Mannosyl Glycoprotein Endo beta N Acetylglucosaminidase Mannosyl glycoprotein endo beta N acetyl glucosaminidase mannosyl oligosaccharide glucosidase Mannosyl Phosphate,Dolichyl Mannosyl Phosphoryl Dolichol mannosylphosphoryltransferase mannosylphosphoryltransferases mannosyl retinyl phosphate mannosyls Mannosylstreptomycin Mannosyltransferase mannosyltransferases mannosym mannosystreptomycin mannosytated protein mannotetraose Mannotetraose 2 alpha N acetylglucosaminyltransferase mannotetrose mannotrihexosan mannotriose manno triose Mann R. Mann Ranges Mann sign