About Directed d-Convex Simple Graphs

About Directed d-Convex Simple Graphs

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 directe...

Full description

Bibliographic Details
Main Authors: Nadejda Sur, Sergiu Cataranciuc
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2008-11-01
Series:Computer Science Journal of Moldova
Online Access:http://www.math.md/files/csjm/v16-n3/v16-n3-(pp323-346).pdf
id doaj-4163cdac6e4a4222b352103434eef0ea
record_format Article
spelling doaj-4163cdac6e4a4222b352103434eef0ea2020-11-24T23:59:56ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422008-11-01163(48)323346About Directed d-Convex Simple GraphsNadejda Sur0Sergiu Cataranciuc1Faculty of Mathematics and Informatics, Moldova State University, A. Mateevici street, 60, MD-2009, Republic of MoldovaFaculty of Mathematics and Informatics, Moldova State University, A. Mateevici street, 60, MD-2009, Republic of MoldovaIn 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. http://www.math.md/files/csjm/v16-n3/v16-n3-(pp323-346).pdf
collection DOAJ
language English
format Article
sources DOAJ
author Nadejda Sur
Sergiu Cataranciuc
spellingShingle Nadejda Sur
Sergiu Cataranciuc
About Directed d-Convex Simple Graphs
Computer Science Journal of Moldova
author_facet Nadejda Sur
Sergiu Cataranciuc
author_sort Nadejda Sur
title About Directed d-Convex Simple Graphs
title_short About Directed d-Convex Simple Graphs
title_full About Directed d-Convex Simple Graphs
title_fullStr About Directed d-Convex Simple Graphs
title_full_unstemmed About Directed d-Convex Simple Graphs
title_sort about directed d-convex simple graphs
publisher Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
series Computer Science Journal of Moldova
issn 1561-4042
publishDate 2008-11-01
description 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.
url http://www.math.md/files/csjm/v16-n3/v16-n3-(pp323-346).pdf
work_keys_str_mv AT nadejdasur aboutdirecteddconvexsimplegraphs
AT sergiucataranciuc aboutdirecteddconvexsimplegraphs
_version_ 1725445619551567872

Similar Items