| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 798 2 |
| Ultima descărcare din IBN: 2017-04-26 08:32 |
| Căutarea după subiecte similare conform CZU |
| 519.1 (117) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012ALLAGAN, Julian-A., SERKAN, Christopher. Bell Numbers of Complete Multipartite Graphs. In: Computer Science Journal of Moldova, 2016, nr. 2(71), pp. 234-242. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 2(71) / 2016 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.1 | ||||||
| Pag. 234-242 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The Stirling number S(G; k) is the number of partitions of the vertices of a graph G into k nonempty independent sets and the number of all partitions of G is its Bell number, B(G). We find S(G; k) and B(G) when G is any complete multipartite graph, giving the upper bounds of these parameters for any graph. |
||||||
| Cuvinte-cheie Bell number, Bell polynomial, Stirling numbers., Partition |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-46518</cfResPublId> <cfResPublDate>2016-08-25</cfResPublDate> <cfVol>71</cfVol> <cfIssue>2</cfIssue> <cfStartPage>234</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/46518</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Bell Numbers of Complete Multipartite Graphs</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Bell number; Bell polynomial; Partition; Stirling numbers.</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>The Stirling number S(G; k) is the number of partitions of the vertices of a graph G into k nonempty independent sets and the number of all partitions of G is its Bell number, B(G). We find S(G; k) and B(G) when G is any complete multipartite graph, giving the upper bounds of these parameters for any graph. </cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-29432</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-47589</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-29432</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-29432-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> <cfFamilyNames>Allagan</cfFamilyNames> <cfFirstNames>Julian-A.</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-47589</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-47589-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2016-08-25T24:00:00</cfStartDate> <cfFamilyNames>Serkan</cfFamilyNames> <cfFirstNames>Christopher</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
