| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 944 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. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Sur, N.</dc:creator> <dc:creator>Cataranciuc, S.G.</dc:creator> <dc:date>2008-12-05</dc:date> <dc:description xml:lang='en'>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.</dc:description> <dc:source>Computer Science Journal of Moldova 48 (3) 323-346</dc:source> <dc:title>About Directed d-Convex Simple Graphs</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
