| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 940 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. |
||||||
|
Google Scholar Export
<meta name="citation_title" content="About Directed d-Convex Simple Graphs"> <meta name="citation_author" content="Sur Nadejda"> <meta name="citation_author" content="Cataranciuc Sergiu"> <meta name="citation_publication_date" content="2008/12/05"> <meta name="citation_journal_title" content="Computer Science Journal of Moldova"> <meta name="citation_volume" content="48"> <meta name="citation_issue" content="3"> <meta name="citation_firstpage" content="323"> <meta name="citation_lastpage" content="346"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/About%20Directed%20d_Convex%20Simple%20Graphs.pdf">
|
|
|
