Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
Ultima descărcare din IBN: 2017-04-28 17:41 |
Căutarea după subiecte similare conform CZU |
004.421:519.16/.17 (1) |
Программные средства (302) |
Комбинаторный анализ. Теория графов (115) |
![]() SUR, Nadejda, CATARANCIUC, Sergiu. About Directed d-Convex Simple Graphs. In: Computer Science Journal of Moldova, 2008, nr. 3(48), pp. 323-346. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 3(48) / 2008 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.421:519.16/.17 | ||||||
Pag. 323-346 | ||||||
|
||||||
![]() |
||||||
Rezumat | ||||||
In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple. We give an iterative method of description of the set of all directed d-convex simple graphs. Then we research the structure of directed d-convex simple graphs and do this by using some new operations and new graphs. After that we show that the set of directed d-convex simple graphs contains all known undirected d-convex simple graphs. |
||||||
|
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-2634</cfResPublId> <cfResPublDate>2008-12-05</cfResPublDate> <cfVol>48</cfVol> <cfIssue>3</cfIssue> <cfStartPage>323</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/2634</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>About Directed d-Convex Simple Graphs</cfTitle> <cfAbstr cfLangCode='EN' cfTrans='o'>In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple. We give an iterative method of description of the set of all directed d-convex simple graphs. Then we research the structure of directed d-convex simple graphs and do this by using some new operations and new graphs. After that we show that the set of directed d-convex simple graphs contains all known undirected d-convex simple graphs.</cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-25745</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-710</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-25745</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-25745-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> <cfFamilyNames>Sur</cfFamilyNames> <cfFirstNames>Nadejda</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-710</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-710-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2008-12-05T24:00:00</cfStartDate> <cfFamilyNames>Cataranciuc</cfFamilyNames> <cfFirstNames>Sergiu</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>