Graphic sequences with a realization containing a generalized friendship graph

Gould, Jacobson and Lehel [R.J. Gould, M.S. Jacobson, J. Lehel, Potentially G-graphical degree sequences, in: Y. Alavi, et al. (Eds.), Combinatorics, Graph Theory and Algorithms, vol. I, New Issues Press, Kalamazoo, MI, 1999, pp. 451–460] considered a variation of the classical Turán-type extremal p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete mathematics Ročník 308; číslo 24; s. 6226 - 6232
Hlavní autoři:	Yin, Jian-Hua, Chen, Gang, Schmitt, John R.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier B.V 28.12.2008 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Degree sequence Exact sciences and technology Generalized friendship graph Graph theory Information retrieval. Graph Mathematics Potentially [formula omitted]-graphic sequence Sciences and techniques of general use Theoretical computing Potentially F t , r , k -graphic sequence Generalized friendship graph Degree sequence Integer Graphics Algorithm theory Complete graph Subgraph Graph theory Combinatorics Potentially Ft,r,k-graphic sequence Graph algorithm
ISSN:	0012-365X, 1872-681X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!