Skip to search formSkip to main contentSkip to account menu

Turán graph

Known as: Cocktail party graph, Octahedral graph, Turan graph 
The Turán graph T(n,r) is a complete multipartite graph formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the… 
2018
2018
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving… 
2011
2011
We consider an old problem of Linial and Wilf to determine the structure of graphs which allows the maximum number of $q… 
2011
2011
A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that… 
2009
2009
Nanomagnets synthesized by the magnetotactic bacterium Magnetospirillum gryphiswaldense have been characterized. Transmission… 
1992
1992
We shall investigate the behavior of the Ramsey function r(L, Tn), where L is a fixed graph and Tn is a tree on n vertices, while… 
1987
1987
1979
1979
The three-dimensional structure of systems of the type M(bidentate)3 has been examined within the framework of a model taking…