Paths and Cycles
Domination game on paths and cycles
... Abstract Domination game is a game on a simple graph played by two players, Dominator and Staller who are alternating in taking turns. In each turn a player chooses a vertex in such a way that at least one new vertex ...
12
On-line Ramsey Numbers of Paths and Cycles
... Keywords: On-line Ramsey theory; Combinatorial games; Paths; Cycles. ∗ Partially supported by the Polish National Science Centre grant 2011/02/A/ST6/00201. † The research leading to these results has ...
32
Finding k Simple Shortest Paths and Cycles
... shortest paths need not have the same ...shortest paths (SiSP) and cycles (SiSC) in a weighted directed graph under the following set-ups: the k simple shortest paths for all pairs of vertices ...
12
Roman domination number on cardinal product of paths and cycles
... E-mail: ⟨[email protected]⟩ Abstract. In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the ...
8
An Alternate C++ Programme for Total Dominator Chromatic Number of Paths and Cycles
... ⌋ MAIN RESULT We have to find the total dominator chromatic number of paths and cycles by using C++ programme by removing the corresponding rows and columns of the repeated colors from the adjacency matrix. ...
18
Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
... To cite this article: Shokry Nada, Amani Elrayes, Ashraf Elrokh, Aya Rabie. Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles. Machine Learning Research. Vol. 4, No. 4, ...
6
Paths and compatible hamiltonian cycles
... This problem belongs to a conjecture that has been present for a while, which says that given a set of points in the plane, there is always a spanning tree compatible with a Hamiltonian cycle. Very recently, the more ...
116
Paths, Cycles and Wheels in Graphs without Antitriangles
... We investigate paths, cycles and wheels in graphs with independence number of at most 2, in particular we prove theorems characterizing ali such graphs which are [r] ...
12
Rank numbers for graphs with paths and cycles
... This Thesis is brought to you for free and open access by the Thesis/Dissertation Collections at RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administ[r] ...
32
Approximating Longest Directed Paths and Cycles
... shows that there exists j, such that ij+1 − i j ≥ |W |/s. Let q be the index for which rq = pi j . The path along R from r 0 to rq and continuing along P from p i j +1 to pi j+1 −1 has the claimed length. Observe ...
14
Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs
... To construct the algorithms we use a decomposition theorem that characterizes quasi-transitive digraphs in a recursive sense [1 J, characterizations of semicomplete multipartit[r] ...
6
Thesis: Paths and Cycles in Graphs. Adviser: Professor K. Ota.
... An O(log n) approximation algorithm for the edge-disjoint paths problem in eulerlian planar graphs and 4-edge-connected planar graphs (with Y.. Message duplication reduction in dense mob[r] ...
22
TOTAL DOMINATOR CHROMATIC NUMBER OF PATHS AND CYCLES THROUGH COMPUTER PROGRAMMING. Associate Professor of Mathematics, S. T. Hindu College, Nagercoil
... A path of 'n' vertices, denoted by P , is a connected graph where all but n two vertices have degree 1. We label the vertices of P as v for (l ≤ i ≤ n). n i Furthermore let (v , v ) be an edge of P for i<n. i i+1 n ...
6
CiteSeerX — On multicolor Ramsey number of paths versus cycles
... the proof. Corollary 3.20 For all integers m ≥ 6, R(P 4 , P 6 , P m ) = m + 3. 4 Multicolor Ramsey number of paths In this section, we give an improvement of a result of Faudree and Schelp [7] on multicolor ...
16
Partitioning edge coloured complete graphs into monochromatic cycles and paths
... Subsequently, Erd˝ os, Gy´ arf´ as, and Pyber made the following stronger conjecture. Conjecture 1.2 (Erd˝ os, Gy´ arf´ as & Pyber, [6]). The vertices of every r-edge coloured complete graph can be covered with r ...
26
Concept Paths. Energy Flow Cycles Diversity Change Interrelationships Communities Adaptations
... 2. Many of the concepts build off of each other. If you take the time walking between activity areas reviewing the information that you have covered or chanting the cadence, it will improve your students’ retention and ...
18
Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and Paths
... using paths and ...five paths and three cycles that result in unique syndromes for all links are p 1 = 11-9-4-1-3-2-5-8-6-7, p 2 = 11- 12-9-10-3-4-2-5-6-7, p 3 = 11-10-12-9-4-1-2-5-7, p 4 = 11-10- ...
14
MAPPING OUT RESEARCH PATHS TO SPECIALISED DOMAINS AND DISCOURSE: THE EXAMPLE OF BUSINESS CYCLES AND FINANCIAL CRISES
... economic cycles and financial crises as an example, and is based on a corpus of economics textbooks, research articles, central bank discourse, as well as newspapers and ...
14
ON THE SPECTRA OF CYCLES AND PATHS
... Abstract. Energy of a graph was defined by E. H¨ uckel as the sum of absolute values of the eigenvalues of the adjacency matrix during the search for a method to obtain approx- imate solutions of Schr¨ odinger equation ...
10
Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths
... The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number χ for the total graph of complete bigraphs TK m,n , the central graph ...
6