نتایج جستجو برای: closed graph

تعداد نتایج: 313919  

فرشاد, محسن , فلقی, حمید , مویدی ‌راد, حجت ,

One of the ways of reducing active power losses in the distribution networks is using the network reconfiguration for different load levels. Since the number of possible configuration of a distribution network is usually very much and then review of all of them (especially in the network of large-scale) to finding the optimal configuration is not possible simply, therefore in this paper a new a...

Journal: :Journal of Physics: Conference Series 2021

Journal: :ITU journal 2023

Next Generation Networks (NGNs) are expected to handle heterogeneous technologies, services, verticals and devices of increasing complexity. It is essential fathom an innovative approach automatically efficiently manage NGNs deliver adequate end-to-end Quality Experience (QoE) while reducing operational expenses. An Autonomous Network (AN) using a closed loop can self-monitor, self-evaluate sel...

Journal: :J. Comb. Theory, Ser. B 2002
Dan Archdeacon C. Paul Bonnington R. Bruce Richter Jozef Sirán

An open ribbon is a square with one side called the seam. A closed ribbon is a cylinder with one boundary component called the seam. We sew an open (resp. closed) ribbon onto a graph by identifying the seam with an open (resp. closed) walk in the graph. A ribbon complex is a graph with a nite number of ribbons sewn on. We investigate when a ribbon complex embeds in 3-dimensional Euclidean space...

Journal: :Journal of Graph Theory 1998
Hongbing Fan Xuding Zhu

An oriented walk double covering of a graph G is a set of oriented closed walks which, traversed successively, combined will have traced each edge of G once in each direction. A bidirectional double tracing of a graph G is an oriented walk double covering which consists of a single closed walk. A retracting in a closed walk is the immediate succession of an edge by its inverse. Every graph with...

2013
Alessandro De Luca Gabriele Fici

A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید