نتایج جستجو برای: oriented graph
تعداد نتایج: 322031 فیلتر نتایج به سال:
Aspect-oriented programming (AOP) is an extension to the object oriented paradigm that aims to provide better modularity for code that is usually scattered across an object-oriented system such as logging, authentication and distributed object handling. Aspect weaving is a novel way to compose systems, focusing on the integration of system-wide policies through pattern-action rules. While there...
and d−v are the outdegree and indegree respectively of v and n is the number of vertices in D. The set of distinct scores of the vertices in an oriented graph D is called its score set. If a > 0 and d > 1 are positive integers, we show there exists an oriented graph with score set {a, ad, ad, . . . , ad} except for a = 1, d = 2, n > 0, and for a = 1, d = 3, n > 0. It is also shown that there ex...
1. Introduction. A graph G consists of a set 7 of elements called vertices together with a set E of elements called edges, the two sets having no element in common. With each edge there are associated either one or two vertices called its ends. In this paper we consider only graphs in which each edge has two distinct ends. We call such a graph oriented if one end of each edge is distinguished a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید