Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,519,383 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.
2018
2018
Edge Grundy numbers of the regular Turán graphs
Matthew DeVilbiss
,
Peter D. Johnson
,
Ryan W. Matzke
Bull. ICA
2018
Corpus ID: 213194090
Suppose r ≥ 3 and k ≥ 2 are integers. If k(r − 1) is even then the edge Grundy number of the Turán graph Tkr,r is 2k(r − 1) − 1…
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
2018
2018
Ju l 2 01 5 Cooperative effects of lattice and spin-orbit coupling on the electronic structure of orthorhombic SrIrO 3
Vijeta Singh
,
J. Pulikkotil
2018
Corpus ID: 111375121
Orthorhombic SrIrO3 subjected to strain show tunable transport properties. With underlying symmetry remaining invariant, these…
Expand
2014
2014
EFFECT OF PRESSURE ON MORPHOLOGY AND ADHESION OF HFCVD DIAMOND COATING ON CEMENTED CARBIDE INSERTS
K. SahuD.
,
Sarangi
,
Chattopadhyay
2014
Corpus ID: 212571532
In the present investigation, effect of chamber pressure on morphology, quality and adhesion of hot filament chemical vapour…
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
The Number of 2-matchings and Distinct 4-cycles in a Hyperoctahedral Graph
M. Kanemitsu
2009
Corpus ID: 118733140
2007
2007
A spectral stability theorem for large forbidden graphs
V. Nikiforov
2007
Corpus ID: 115160568
We extend the classical stability theorem of Erdos and Simonovits in two directions: first, we allow the order of the forbidden…
Expand
1992
1992
Local bipartite Turan graph partitioning
J. Ryan
,
Jon Lee
1992
Corpus ID: 117013063
Motivated by the NP-Hard problem of finding a minimum-weight balanced bipartition of an edge-weighted complete graph, we study…
Expand
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