| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 943 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. |
||||||
|
Crossref XML Export
<?xml version='1.0' encoding='utf-8'?> <doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'> <head> <doi_batch_id>ibn-2634</doi_batch_id> <timestamp>1714544062</timestamp> <depositor> <depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name> <email_address>idsi@asm.md</email_address> </depositor> </head> <body> <journal> <journal_metadata> <full_title>Computer Science Journal of Moldova</full_title> <issn media_type='print'>15614042</issn> </journal_metadata> <journal_issue> <publication_date media_type='print'> <year>2008</year> </publication_date> <issue>3(48)</issue> </journal_issue> <journal_article publication_type='full_text'><titles> <title>About Directed d-Convex Simple Graphs</title> </titles> <contributors> <person_name sequence='first' contributor_role='author'> <given_name>Nadejda</given_name> <surname>Sur</surname> </person_name> <person_name sequence='additional' contributor_role='author'> <given_name>Sergiu</given_name> <surname>Cataranciuc</surname> </person_name> </contributors> <publication_date media_type='print'> <year>2008</year> </publication_date> <pages> <first_page>323</first_page> <last_page>346</last_page> </pages> </journal_article> </journal> </body> </doi_batch>
|
|
|
