Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
About Directed d-Convex Simple Graphs
Authors: Nadejda Sur, Sergiu Cataranciuc
– 0.21 Mb
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 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.Faculty of Mathematics and Informatics,
Moldova State University,
A. Mateevici street, 60, MD 2009
Republic of Moldova
E-mail: ,
Moldova State University,
A. Mateevici street, 60, MD 2009
Republic of Moldova
E-mail: ,
Fulltext
– 0.21 Mb
Contents
- About Directed d-Convex Simple Graphs
- Minimum d-convex partition of a multidimensional polyhedron with holes
- About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
- The Development of e-Government in the Republic of Moldova
- e-Services in Moldova: State of the Art
- Confidentiality and Security in Medical Information Systems
- The Computer Science Journal of Moldova (ISSN 1561-4042)
