Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,721,897 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Book embedding
Boxicity
Chromatic polynomial
Clique (graph theory)
Expand
Broader (1)
Extremal graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Remarks on an Edge-coloring Problem
C. Hoppen
,
H. Lefmann
Latin-American Algorithms, Graphs and…
2019
Corpus ID: 204539001
2018
2018
Spectral analysis of the wreath product of a complete graph with a cocktail party graph
Francesco Belardo
,
Matteo Cavaleri
,
A. Donno
2018
Corpus ID: 127574230
Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the…
Expand
2018
2018
Small World Model based on a Sphere Homeomorphic Geometry
Santiago Viertel
,
A. Vignatti
arXiv.org
2018
Corpus ID: 51923642
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving…
Expand
2011
2011
Turán Graphs and the Number of Colorings
Sergey Norin
SIAM Journal on Discrete Mathematics
2011
Corpus ID: 15140286
We consider an old problem of Linial and Wilf to determine the structure of graphs which allows the maximum number of $q…
Expand
2011
2011
On Total Vertex Irregularity Strength of Cocktail Party Graph
K. Wijaya
,
S. Slamin
,
Mirka Miller
2011
Corpus ID: 120341739
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…
Expand
2009
2009
NSOM/HRTEM Characterization of Biologically Derived Cubo–Octahedral Nanomagnets
M. Naresh
,
K. Gopinadhan
,
S. Sekhar
,
P. Juneja
,
M. Sharma
,
A. Mittal
IEEE transactions on magnetics
2009
Corpus ID: 24445267
Nanomagnets synthesized by the magnetotactic bacterium Magnetospirillum gryphiswaldense have been characterized. Transmission…
Expand
2007
2007
Graphs without minor complete subgraphs
M. Cera
,
A. Diánez
,
P. García-Vázquez
,
J. C. Valenzuela
Discrete Mathematics
2007
Corpus ID: 2232155
1992
1992
Ramsey problems and their connection to tuŕan-type extremal problems
R. Faudree
,
M. Simonovits
Journal of Graph Theory
1992
Corpus ID: 19738041
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…
Expand
1987
1987
Root Systems and The Johnson and Hamming Graphs
Paul M. Terwilliger
European journal of combinatorics (Print)
1987
Corpus ID: 20763283
1979
1979
Interligand interaction and three-dimensional structure of coordination compounds. Compounds of the tris(bidentate)M type
V. G. Dashevskii
,
Rubik Asatryan
,
A. P. Baranov
1979
Corpus ID: 91914270
The three-dimensional structure of systems of the type M(bidentate)3 has been examined within the framework of a model taking…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE