circular arc graph
Algorithms for Finding an Efficient Dominating Set of an Interval Graphand a Split Dominating Set of a Circular-Arc Graph
... ABSTRACT: Interval graphs are rich in combinatorial structures and have found applications in several disciplines such as traffic control, Ecology, Biology, Computer Science etc. .Circular-arc graphs are ...
8
Domination Numbers, Chromatic Numbers and Total Domination Numbers of all Powers of Cycles using a Circular Arc Graph G
... of circular-arc graphs. In fact every interval graph is a Circular-arc graph and the converse need not be ...extensively. Circular- arc graphs are rich in ...
9
An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular Arc Graph
... intersection graph of a col- lection of arcs on a circle is called a circular-arc ...Helly circular-arc graph is a proper subclass of the set of circular-arc ...
9
L(2,1)-labelling of Circular-arc Graph
... an arc will be called the starting point of the ...an arc will be called the finishing point of that arc. An arc A i is denoted by a closed interval [ , s f i i ], i = 1, 2, … , n , where, s i ...
12
The Comparison of Domination Number, Bondage Number and the Average Distance of Circular-Arc Graphs
... sites. Circular-arc graphs are rich in combinatorial structures and have found applications in several disciplines such as Biology, Ecology, Psychology, Traffic control, Genetics, Computer sciences and ...
10
The Hamiltonian Cycle Problem on Circular-Arc Graphs
... a circular-arc ...on circular-arc graphs ...on circular-arc graphs ...on circular-arc graphs [5] contains a flaw which was pointed out in ...on ...
8
Resource Allocation in Survivable WDM Networks Under a Sliding Scheduled Traffic Model
... Saradhi and Gurusamy [5] present two circular arc graph theory based algorithms, namely Independent Sets Algorithm (ISA) and Time Window Algorithm (TWA) to solve the RWA pr[r] ...
80
The Bondage Numbers Extended To Directed Circular Arc Graphs
... a Circular-arc graph, if there is a one-to-one correspondence between V and A such that two vertices in V are adjacent if and only if their corresponding arcs in A intersect ...connected graph ...
7
The 2-Tuple Domination Problem on Circular-arc Graphs
... Eschen and Spinrad [6] presented an O ( n 2 ) -time algorithm for recognizing a circular-arc graph and constructing a circular-arc model. There are several results on the ...
11
Computation of a Minimum Average Distance Tree on Circular-arc Graphs
... Proof. Let G = (V, E) be any circular-arc graph. Then, using Section 2.2, one can design a minimum diameter spanning tree. In this minimum diameter spanning tree, shifting (if necessary, under ...
7
Arc Sequence in Complete and Regular Fuzzy Graphsc
... effectiveness. Graph theory is a widely used tool for solving combinatorial problems in different areas such as geometry, algebra, number theory, topology, optimization and computer ...
6
Experimental Study of Separated Flow Control Over a Sharp-Edged Arc Airfoil
... The purpose of this research was to develop a flow control mechanism that could generate a pulsing jet along a slotted nozzle to increase the lift of circular-arc airfoils. A novel pulsing jet actuator was ...
6
Properties of Directed Rough Graph
... rough graph, based on the definitions of adjacency matrix and edge list of rough graph[3] and adjacency matrix and arc list of directed rough graph, in the following paragraph we will give ...
5
Numerical Solution for Circular Arc Cracks in Half Plane Elasticity
... The calculated SIFs at the cracks tips are given in Table 2, Table 3, and Table 4 in which illustrate the variation of the SIFs with γ = 15 ◦ , 30 ◦ , 45 ◦ , 60 ◦ , 75 ◦ , 90 ◦ and dimension- less distance 2b/h = 0.1, ...
10
Design and analysis of uwb antenna for use in aeronautical radio navigation
... This paper presented the design for an UWB antenna for military use, specifically in air radio-navigation services. The focus was to construct and simulate an antenna with the characteristics of an ultra-wide band, along ...
5
Multiple Circular Colouring as a Model for Scheduling
... Conclusion We proved that for a large class of graphs, this multiple circular colouring and m-circular chromatic number of the conflict graph will provide better solutions for the schedu[r] ...
5
Design of Circular Arc Blade Hydrokinetic Turbine—A Case of Rural Electrification in Zambia
... a circular arc blade hydrokinetic turbine ...prototype circular arc blade horizontal axis hydrokinetic turbine was tested in one of stream in Zambia and the results were compared with the ...
10
Reconstructing passively travelled manoeuvres: Visuo-vestibular interactions.
... The set-up of the visual stimulation and the response apparatus have been described elsewhere in more detail (Bertin, Israël et al., 2000; Bertin and Israël, 2002). Visual stimuli were generated on a Silicon ...
16
Performance of Hollow Circular Columns in comparison with Solid Circular Columns in High Rise Buildings subjected to Wind Excitations
... above graph represents a maximum storey drift of ...solid circular column, whereas a maximum storey drift of ...hollow circular columns in G+20 storeyed building which was subjected to wind loads for ...
7
Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co Occurrence Constraints
... the graph branch algo- rithm for obtaining the optimum solution for a DF used in ...The graph branch algorithm assures the search for the optimum trees with arbitrary arc co-occurrence constraints, ...
8