| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 941 2 |
| Ultima descărcare din IBN: 2017-04-28 17:41 |
| Căutarea după subiecte similare conform CZU |
| 004.421:519.16/.17 (1) |
| Programe. Software (296) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012SUR, 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 | ||||||
|
||||||
 Descarcă PDF |
||||||
| 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 iter ative 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. |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Sur, N.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Cataranciuc, S.G.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>About Directed d-Convex Simple Graphs</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2008</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004.421:519.16/.17</subject> </subjects> <dates> <date dateType='Issued'>2008-12-05</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'>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 iter ative 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.</description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
