UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
|
|
- Denis Palmer
- 6 years ago
- Views:
Transcription
1 UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) Dipartimento di Matematica Guido Castelnuovo Ple Aldo Moro, Roma - Italia
2 On d-graceful labelings Anita Pasotti Abstract We introduce a generalization of the well known concept of a graceful labeling Given a graph Γ with e = d m edges, we call d-graceful labeling of Γ an injective function from V (Γ) to the set 0,,,, d(m + ) } such that f(x) f(y) x, y E(Γ)} =,, 3,, d(m + ) } m +, (m + ),, (d )(m + )} In the case of d = and of d = e we find the classical notion of a graceful labeling and of an odd graceful labeling, respectively Also, we call d-graceful α-labeling of a bipartite graph Γ a d-graceful labeling of Γ with the property that its maximum value on one of the two bipartite sets does not reach its minimum value on the other one We show that these new concepts allow to obtain cyclic graph decompositions We investigate the existence of d-graceful α-labelings for several classes of bipartite graphs, completely solving the problem for paths and stars and giving partial results about cycles and ladders Introduction As usual, we will denote by K v and K m n the complete graph on v vertices and the complete m-partite graph with parts of size n, respectively For any graph Γ we write V (Γ) for the set of its vertices, E(Γ) for the set of its edges, and D(Γ) for the set of its di-edges, namely the set of all ordered pairs (x, y) with x and y adjacent vertices of Γ If E(Γ) = e, we say that Γ has size e Let Γ be a subgraph of a graph K A Γ-decomposition of K is a set of graphs, called blocks, isomorphic to Γ whose edges partition E(K) In the case that K = K v one also speaks of a Γ-system of order v An automorphism of a Γ-decomposition D of K is a bijection on V (K) leaving D invariant A Γ-decomposition of K is said to be cyclic if it admits an automorphism consisting of a single cycle of length V (K) In this case for giving the set B of blocks it is enough to give a complete system of representatives for the orbits of B under the cyclic group The blocks of such a system are usually called base blocks For a survey on graph decompositions we refer to 3 The concept of a graceful labeling of Γ, introduced by A Rosa, is quite related to the existence problem for cyclic Γ-systems A graceful labeling of a graph Γ of size e is an injective map f from V (Γ) to the set of integers 0,,,, e} such that f(x) f(y) x, y E(Γ)} =,,, e} A graph Γ is said to be graceful if there exists a graceful labeling of it In the case that Γ is bipartite and f has the additional property that its maximum value on one of the two bipartite sets does not reach its minimum value on the other one, one says that f is an α-labeling Every graceful labeling of a graph Γ of size e gives rise to a cyclic Γ-system of order e + Dipartimento di Matematica, Facoltà di Ingegneria, Università degli Studi di Brescia, Via Valotti, 9, I-533 Brescia, Italy anitapasotti@ingunibsit
3 but an α-labeling of Γ gives much more; it gives in fact a cyclic Γ-system of order et + for every positive integer t (see ) and other kinds of graph decompositions such as, for instance, a bicyclic Γ-decomposition of K e (see 8) and a cyclic Γ-decomposition of K m e for every odd integer m coprime with e (see 5) For a very rich survey on graceful labelings we refer to 9 Many variations of graceful labelings have been introduced In particular Gnana Jothi 0 defines an odd graceful labeling of a graph Γ of size e as an injective function f : V (Γ) 0,,,, e } such that f(x) f(y) x, y E(Γ)} =, 3, 5,, e } If such a function exists Γ is said to be odd graceful She proved that every graph with an α- labeling is also odd graceful, while the converse, in general, is not true One of the applications of these labelings is that trees of size e, with a suitable odd graceful labeling, can be used to generate cyclic decompositions of the complete bipartite graph K e For results on odd graceful graphs see, 7, 5 Here we propose the following new definition which is, at the same time, a generalization of the concepts of a graceful labeling and of an odd graceful labeling Definition Let Γ be a graph of size e and let d be a divisor of e, say e = d m Ad-graceful labeling of Γ is an injective function f : V (Γ) 0,,,, d(m + ) } such that f(x) f(y) x, y E(Γ)} =,, 3,, d(m + ) } m +, (m + ),, (d )(m + )} If Γ admits a d-graceful labeling we will say that Γ is a d-graceful graph Note that we find again the concepts of a graceful labeling and of an odd graceful labeling in the two extremal cases of d = and d = e, respectively By saying that d is admissible we will mean that it is a divisor of e and hence that it makes sense to investigate the existence of a d-graceful labeling of Γ It is well known that the complete graph K v is graceful if and only if v, see At the moment we are not able to extend this result to d-graceful labelings of the complete graph with d> We recall that a (v, d, k, λ)-relative difference set (RDS) in a group G is a k-subset S of G such that the list of all differences x y with (x, y) an ordered pair of distinct elements of S covers G H exactly λ times, and no element of H at all with H a suitable subgroup of G of order d (see 3 for a survey on this topic) A RDS as above is said to be cyclic if G is such It is immediate to recognize that every d-graceful labeling of K v can be seen as a cyclic (v(v )+d, d, v, )-RDS though the converse is not true in general For instance, the labeling of the vertices of K 5 with the elements of the set S = 0,,, 9, } is -graceful and we see that S is a (0,, 5, )-RDS Now note that S = 0,, 3,, 0} is also a cyclic (0,, 5, )-RDS, but it is evident that the labeling of the vertices of K 5 with the elements of S is not -graceful The very few known results about cyclic RDSs do not allow us to say much more about the d-gracefulness of the complete graph with d> Also α-labelings can be generalized in a similar way Definition A d-graceful α-labeling of a bipartite graph Γ is a d-graceful labeling of Γ having the property that its maximum value on one of the two bipartite sets does not reach its minimum value on the other one In the next section we will see how these new concepts can be used to obtain some graph decompositions Then we investigate the existence of d-graceful α-labelings for several classes of
4 bipartite graphs In particular, we prove that paths and stars admit a d-graceful α-labeling for any admissible d We also present partial results about d-graceful labelings of cycles and ladders d-graceful labelings and graph decompositions It is known that graceful labelings are related to difference families, see The concept of a relative difference set has been generalized in to that of a relative difference family A further generalization has been introduced in 6 Definition Let Γ be a graph and let d be a divisor of v A(v, d, Γ, )-difference family (DF for short) is a collection F of injective maps from V (Γ) to Z v such that the list F = f(x) f(y) f F; (x, y) D(Γ)} covers Z v v d Z v exactly once while it does not contain any element of v d Z v, where v d Z v denotes the subgroup of Z v of order d If a (v, d, Γ, )-DF consists of a single map f one says that f is a difference graph In 6 it is proved that Theorem If there exists a (v, d, Γ, )-DF then there exists a cyclic Γ-decomposition of K v d d The next easy proposition establishes the link between d-graceful labelings and DFs Proposition 3 A d-graceful labeling of a graph Γ of size e determines a ( d( e d + ), d, Γ, ) - DF Proof Let f : V (Γ) 0,,, d ( e d +) } be a d-graceful labeling of Γ It is obvious that φ : x V (Γ) f(x) Z d( e +) is a ( d( e d d + ), d, Γ, ) -DF By the above considerations we can state Proposition If there exists a d-graceful labeling of a graph Γ of size e then there exists a cyclic Γ-decomposition of K ( e d +) d Example 5 Figure shows a -graceful labeling of C 6 Hence B = (0,, 3, 6,, 7) is a base block of a cyclic C 6 -decomposition of K Figure : A -graceful labeling of C 6 The following result shows that, as in the case of classical graceful labelings, d-graceful α-labelings are more powerful than d-graceful labelings 3
5 Theorem 6 If there exists a d-graceful α-labeling of a graph Γ of size e then there exists a cyclic Γ-decomposition of K ( e d +) dn for any integer n Proof Let f be a d-graceful α-labeling of Γ, so that we have max f(x) < min f(y ) where X and Y are the two parts of Γ It is easy to see that the set of maps f,f,, f n } from V (Γ) to Z dn( e d +) defined by f i (x) =f(x) x X, i =,, n f i (y) =f(y) + (i )(d + e) y Y, i =,, n is a ( dn( e d + ), dn, Γ, ) -DF Hence by Theorem there exists a cyclic Γ-decomposition of K ( e d +) dn for any integer n Example 7 Figure shows a -graceful α-labeling of C 6 such that there exists a cyclic C 6 - decomposition of K n for any integer n, n The set of base blocks of such a decomposition is given by (0, 5 + 8i,, 3 + 8i,, 7 + 8i) i =0,, n } Figure : A -graceful α-labeling of C 6 3 d-graceful α-labelings of paths and stars In this section we will show that paths and stars have a d-graceful α-labeling for any admissible d From now on, given two integers a and b, by a, b we will denote the set of integers x such that a x b As usual we will denote by P e+ the path on e + vertices, having size e We recall that any path admits an α-labeling, see Theorem 3 Given a positive integer e, the path P e+ has a d-graceful α-labeling for any admissible d Proof Let e = d m and let P dm+ =(x x x dm+ ) We distinguish two cases depending on the parity of m Case : m even Denote by O = x,x 3,,x dm+ } and E = x,x,,x dm } the bipartite sets of P dm+ Let f : V (P dm+ ) 0,d(m + ) be defined as follows: f(x i+ )=i for i 0, dm
6 f(x i )= One can check that f(o) = 0, dm dm (d + )m f(e) = +, (d + )m +3, d(m + ) i for i, m d(m + ) i for i m +,m d(m + ) i for i m +, 3m d(m + ) i (d ) (d + )m (d + 3)m + Hence f is injective and max f(o) < min f(e) Now set for i (d + )m +, (d )m +, dm + d(m + ) m,d(m + ) ε i = f(x i ) f(x i ), ρ i = f(x i ) f(x i+ ) for i =,, dm () By a direct calculation, one can see that ε i,ρ i i =,, m } = (d )(m + ) +,d(m + ) ; ε i,ρ i i = m } +,, m = (d )(m + ) +, (d )(m + ) ; ε i,ρ i i = This concludes case (d )m (d )m ε i,ρ i i = +,, dm } (d )m +,, =m +, (m + ) ; } =,m Case : m odd We divide this case in two subcases depending on the parity of d Case a): d odd In this case the bipartite sets are O = x,x 3,,x dm } and E = x,x,, x dm+ } Let f : V (P dm+ ) 0,d(m + ) be defined as follows: f(x i+ )= f(x i )= i for i 0, m i + for i m+, 3m i + for i 3m+, 5m i + d for i (d )m+, dm d(m + ) i for i,m d(m + ) i for i m +, m d(m + ) i for i m +, 3m d(m + ) i d for i (d )m +, dm+ 5
7 In this case it results that f(o) = 0, m m +3 3m +, 3m +5 5m +3 (d )m + d d(m + ),, d(m + ) (d + )(m + ) f(e) =, (d + )(m + ) (d + 3)(m + ) +, (d + 3)(m + ) (d + 5)(m + ) +, d(m + ) m, d(m + ) So, also in this case, f is injective and max f(o) < min f(e) Note that, now, since dm is odd we have to consider ε i = f(x i ) f(x i ), ρ i = f(x i ) f(x i+ ) for i =,, dm, = f(x dm ) f(x dm+ ) ε dm+ By a long and tedious calculation, one can see that ε i,ρ i i =,, m } ρ m+ ρ (d )m+ } ε m+ ε i,ρ i i = m +3,,m } =(d )(m + ) +, d(m + ) ; } =(d )(m + ) +, } (d )m + ε i,ρ i i = +,, (d )m ε i,ρ i i = +,, dm (d )(m + ) ; } (d )m = =m +, (m + ) ; } } =,m ε dm+ This completes the proof of Case a) Case b): d even Let f : V (P dm+ ) 0,d(m + ) be defined as follows: i for i 0, m i + for i m+, 3m i + for i 3m+ f(x i+ )=, 5m i + d for i (d )m+, dm 6
8 f(x i )= d(m + ) i for i,m d(m + ) i for i m +, m d(m + ) i for i m +, 3m d(m + ) i d for i (d )m +, dm Also here, reasoning as in Case a), it is easy to see that f is a d-graceful α-labeling of P dm+ Proposition 3 There exists a cyclic P e+ -decomposition of K ( e d +) dn for any integers e, n and any divisor d of e Proof It is a direct consequence of theorems 6 and 3 In Figure 3 we have the d-graceful α-labelings of P 9 for d =, 3, 6, 9, 8, obtained following the construction given in the proof of Theorem 3 Note that these are all the possible d- graceful α-labelings of P 9, apart from the already known case of a classical α-labeling (d = ), Figure 3: P 9 We recall that the star on e + vertices S e+ is the complete bipartite graph with one part having a single vertex, called the center of the star, and the other part having e vertices, called external vertices It is obvious that any star has an α-labeling Theorem 33 Given a positive integer e, the star S e+ has a d-graceful α-labeling for any admissible d Proof Let e = d m It is obvious that if we label the center of the star with 0 and the external vertices, arbitrarily, with the elements of,, 3,, d(m + ) } m +, (m + ),, (d )(m + )}, we have a d-graceful α-labeling of S e+ 7
9 Applying Theorem 6 we have: Proposition 3 There exists a cyclic S e+ -decomposition of K ( e d +) dn for any integers e, n and any divisor d of e d-graceful α-labelings of cycles and ladders As usual, we will denote by C k the cycle on k vertices It is obvious that C k is a graph of size k and that it is bipartite if and only if k is even In Rosa proved that C k has an α-labeling if and only if k 0(mod ) Theorem The cycle C k has a -graceful α-labeling for every k Proof Let C k =(x,x,, x k ) and denote by O = x,x 3,, x k } and E = x,x,, x k } its bipartite sets of vertices Consider the map: f : V (C k ) 0,,, k +} defined as follows: We have f(x i+ )=i for i 0, k k + i for i,k f(x i )= k i for i k +, k f(o) = 0, k f(e) = k, 3k 3k +, k + In this way we see that f is injective Also, note that max f(o) < min f(e) Now set ε i,ρ i (for i =,,k) as in (), where the indices are understood modulo k One can easily check that ε i,ρ i i =,, k} = k +, k + and Hence f is a -graceful α-labeling of C k ε i,ρ i i = k +,, k} =, k Theorem The cycle C k admits a -graceful α-labeling for every k Proof Let O and E be defined as in the proof of the previous theorem We are able to prove the existence of a -graceful α-labeling of C k by means of two direct constructions where we distinguish the two cases: k even and k odd Case : k even Consider the map: f : V (C k ) 0,,, k +3} defined as follows: i for i 0, 3k f(x i+ )= i + for i 3k, k k + i for i, k f(x i )= k +3 i for i k +,k k + i for i k +, k 8
10 It is easy to see that f(o) = 0, 3k f(e) = k +, 3k 3k +, k 3k +3, 7k + 7k +, k +3 Hence f is injective and max f(o) < min f(e) Set ε i and ρ i (for i =,, k) as in (), where the indices are understood modulo k It is not hard to see that ε i,ρ i i =,, k } = 3k +, k + 3; ε i,ρ i i = k } +,, k = k +3, 3k + ; ε i,ρ i i = k +,, 3k } =k +3, k; ε i,ρ i i = 3k },, k =,k k +} k +} The thesis follows Case : k odd Let now f : V (C k ) 0,,, k +3} be defined as follows: i for i 0, k f(x i+ )= i + for i k+, k k + i f(x i )= k + i One can check that f(o) = 0, k f(e) = k +, for i,k for i k +, 3k k + i for i 3k+, k k +3 5k +, k 5k +5, 3k + 3k +, k + 3 Also in this case f is injective and max f(o) < min f(e) By a direct calculation, one can see that ε i,ρ i i =,, k } = 3k +5, k + 3; ε i,ρ i i = k + },, k = k +3, 3k + 3k +}; ε i,ρ i i = k +,, 3k } =k +, k; } 3k + ε i,ρ i i =,,k =,k k +} 9
11 The assertion then follows The two figures in Figure show the -graceful α-labeling and the -graceful α-labeling of C 6 provided by the previous theorems Figure : C 6 By virtue of Theorems 6, and, we have Proposition 3 There exists a cyclic C k -decomposition of K (k+) n, and a cyclic C k - decomposition of K (k+) 8n for any integers k, n Theorem For any odd integer k>, the cycle C k is -graceful Proof For k =3, 5, 7 we show directly a -graceful labeling: C 6 = (0, 5,, 3,, 7), C 0 = (0,,, 3, 7,, 5, 0,, 9), C = (0, 5,,,,, 0, 5, 7, 6,, 3, 3, ) Let now k be greater than 7 and set C k =(x,x,x 3,, x k ) Let O = x,x 3,, x k } and E = x,x,, x k } We will construct a -graceful labeling of C k where we distinguish two cases according to whether k (mod ) or k 3(mod ) Case : k (mod ) In this case k =t+ with t even Consider the map f : V (C k ) 0,,, k +} defined as follows: i for i 0, t 7 t +3 i for i t +,t f(x i+ )= 3t + i for i t +,t+ t t + + i for i t + t +, 3 t i t for i 3 t +, t t + i for i, t t + i for i t +,t+ f(x i )= t + + i for i t +,t+ t+ 3t + i for i t + t+ +, 3 t 5t + i for i 3 t +, t + If t = skip the third assignment of f(x i ) One can directly check that f(o) = 0, t 5 t t +3, 3t + t +, t + 0
12 f(e) = t t +, t +3 3 t +, t +, 5 t t + t t +, 3 t + t + +,t t +3, t + + 3t +3, 7 t +3 t + So f is an injective function Now set ε i and ρ i (for i =,, k) as in () where the indices are understood modulo k By a direct calculation one can see that ε i,ρ i i =,, t } = 3t +, t + 3 ε t + = t + } ρ t + ε i,ρ i i = t } +,, t ε t+ } =t +, t + ρ t+ = t We write the remaining differences and distinguish two subcases depending on the parity of t If t is even, it results: ε i,ρ i i = t +,, 5 } t =, t ε 5 t+ = ρ 5 t+ } ρ 3 t+ } ρ t+ =3t +3 ε i,ρ i i = 5 t +,, 3 t } t ε3 t+ } = +,t+ ε i,ρ i i = 3 t +,, t } ε t+ } = t +3, 3t + If t is odd, we have: } 5 } ε i,ρ i i = t +,, t ε 5 t + =, t ρ 5 5 ε i,ρ i i = t +,, 3 } t t ε3 t+} = +,t+ } ρ 3 t+ ε i,ρ i i = 3 } t +,, t ε t+ } = t +3, 3t + t + = ρ t+ =3t +3 This concludes the proof of case Case : k 3(mod ) In this case k =t + with t 5 odd We define f : V (C k ) 0,,, k +} in the following
13 way f(x i+ )= f(x i )= for i 0, t i 7t+5 i for i t+,t 3t + i for i t +,t+ t+ t + + i for i t + t+ 3t +, i t for i 3t+, t t + i for i, t+ t + i for i t+3,t+ t + + i for i t +,t+ t+3 3t + i for i t + t+3 3t+ +, 5t + i for i 3t+3, t + Also in this case one can directly check that f(o) = 0, t 5t +5, 3t + t + 5t +3 t + +, 7t +7 3t + f(e) =, t +3 t +, 3t +3 t +3, t + t + t + t +,t t +3, t + + 3t +3, 7t +5, t + t +3 By long calculations one can verify that, also in case, f is a -labeling of C k In Figure 5 we have the -graceful labeling of C 6 and that of C 30 obtained through the construction given in the proof of Theorem Figure 5: C 6 and C 30
14 To conclude we consider d-graceful α-labelings for ladders We recall that the ladder graph of order k, denoted by L k, can be seen as the cartesian product of the path P = (0 ) of length by the path P k = (0 k ) of length k The ladder graph L k is clearly bipartite with bipartite sets A 0, A where A h is the set of pairs (i, j) 0, } 0,,, k } such that i + j has the same parity as h Theorem 5 The ladder graph L k has a -graceful α-labeling if and only if k is even Proof Since L k has e =3k edges, divides e if and only if k is even Suppose now k to be even One can check that a -graceful α-labeling of L k is given by j if (i, j) A 0 f(i, j) = 3k j if (i, j) A,j=0,, k 3k j if (i, j) A,j= k,,k We observe that the -graceful α-labeling constructed in the previous theorem is very similar to the α-labeling of L k proposed by the author in Figure 6 shows the -graceful α-labeling of L 6 provided by Theorem Figure 6: L 6 As an immediate consequence of Theorem 6 we have Proposition 6 Let k be an even integer There exists a cyclic L k -decomposition of K 3k n for any integer n References RJR Abel and M Buratti, Difference families, in: CRC Handbook of Combinatorial Designs (CJ Colbourn and JH Dinitz eds), CRC Press, Boca Raton, FL (006), C Barrientos, Odd-graceful labelings of trees of diameter 5, ACKE J Graphs Combin 6 (009), D Bryant and S El-Zanati, Graph decompositions, in: CRC Handbook of Combinatorial Designs (CJ Colbourn and JH Dinitz eds), CRC Press, Boca Raton, FL (006),
15 M Buratti, Recursive constructions for difference matrices and relative difference families, J Combin Des 6 (998), M Buratti and L Gionfriddo, Strong difference families over arbitrary graphs, J Combin Des 6 (008), M Buratti and A Pasotti, Graph decompositions with the use of difference matrices, Bull Inst Combin Appl 7 (006), P Eldergill, Decomposition of the Complete Graph with an Even Number of Vertices, M Sc Thesis, McMaster University, SI El Zanati and C Vanden Eynden, Decompositions of K m,n into cubes, J Combin Des (996), JA Gallian, Dynamic survey of graph labelings, Electron J Combin 7 (00), DS6, 6pp 0 RB Gnana Jothi, Topics in Graph Theory, PhD Thesis, Madurai Kamaraj University 99 SW Golomb, How to number a graph, in Graph Theory an Computing, RC Read, ed, Academic Press, New York (97), 3 37 A Pasotti, Constructions for cyclic Moebius ladder systems, Discr Math 30 (00), A Pott, A survey on relative difference sets, in Groups, Difference Sets, and the Monster, K T Arasu et al (Editors), Walter de Gruyter, Berlin (996), 95 3 A Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat Symposium, Rome, July 966), Gordon and Breach, N Y and Dunod Paris (967), MA Seoud, AEI Abdel Maqsoud and EA Elsahawi, On strongly-c harmonious, relatively prime, odd graceful and cordial graphs, Proc Math Phys Soc Egypt, 73 (998), 33 55
Labelings of unions of up to four uniform cycles
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 29 (2004), Pages 323 336 Labelings of unions of up to four uniform cycles Diane Donovan Centre for Discrete Mathematics and Computing Department of Mathematics
More informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
More informationGraph products and new solutions to Oberwolfach problems
Graph products and new solutions to Oberwolfach problems Gloria Rinaldi Dipartimento di Scienze e Metodi dell Ingegneria Università di Modena e Reggio Emilia 42100 Reggio Emilia, Italy gloria.rinaldi@unimore.it
More informationGraceful polynomials of small degree
Graceful polynomials of small degree Andrea Vietri 1 1 Dipartimento di Scienze di Base e Applicate per l Ingegneria Sapienza Università di Roma WAGTCN2018, Naples, 13-14 September 2018 Andrea Vietri 1
More informationarxiv: v2 [math.co] 6 Mar 2015
A GENERALIZATION OF THE PROBLEM OF MARIUSZ MESZKA arxiv:1404.3890v [math.co] 6 Mar 015 ANITA PASOTTI AND MARCO ANTONIO PELLEGRINI Abstract. Mariusz Meszka has conjectured that given a prime p = n + 1 and
More informationDirected cyclic Hamiltonian cycle systems of the complete symmetric digraph
Discrete Mathematics 309 (2009) 784 796 www.elsevier.com/locate/disc Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph Heather Jordon a,, Joy Morris b a Department of Mathematics,
More informationOn cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components
On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components R. C. Bunge 1, S. I. El-Zanati 1, D. Gibson 2, U. Jongthawonwuth 3, J. Nagel 4, B. Stanley 5, A. Zale 1 1 Department
More informationA DISCOURSE ON THREE COMBINATORIAL DISEASES. Alexander Rosa
A DISCOURSE ON THREE COMBINATORIAL DISEASES Alexander Rosa Department of Mathematics and Statistics, McMaster University, Hamilton, Ontario, Canada Frank Harary in his article [2] was the first to speak
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationNOTE ON CYCLIC DECOMPOSITIONS OF COMPLETE BIPARTITE GRAPHS INTO CUBES
Discussiones Mathematicae Graph Theory 19 (1999 ) 219 227 NOTE ON CYCLIC DECOMPOSITIONS OF COMPLETE BIPARTITE GRAPHS INTO CUBES Dalibor Fronček Department of Applied Mathematics Technical University Ostrava
More informationSkolem-type Difference Sets for Cycle Systems
Skolem-type Difference Sets for Cycle Systems Darryn Bryant Department of Mathematics University of Queensland Qld 072 Australia Heather Gavlas Department of Mathematics Illinois State University Campus
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA. Semifield spreads
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA Semifield spreads Giuseppe Marino and Olga Polverino Quaderni Elettronici del Seminario di Geometria Combinatoria 24E (Dicembre 2007) http://www.mat.uniroma1.it/~combinat/quaderni
More informationDecompositions and Graceful Labelings (Supplemental Material for Intro to Graph Theory)
Decompositions and Graceful Labelings (Supplemental Material for Intro to Graph Theory) Robert A. Beeler December 1, 01 1 Introduction A graph decomposition is a particular problem in the field of combinatorial
More informationSymmetric configurations for bipartite-graph codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 63-69 Symmetric configurations for bipartite-graph codes Alexander Davydov adav@iitp.ru
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationarxiv: v1 [math.co] 31 Mar 2016
3-pyramidal Steiner Triple Systems Marco Buratti Gloria Rinaldi Tommaso Traetta arxiv:1603.09645v1 [math.co] 31 Mar 2016 October 1, 2018 Abstract A design is said to be f-pyramidalwhen it has an automorphism
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationOn a 3-Uniform Path-Hypergraph on 5 Vertices
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1489-1500 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.512742 On a 3-Uniform Path-Hypergraph on 5 Vertices Paola Bonacini Department
More informationSuper Fibonacci Graceful Labeling
International J.Math. Combin. Vol. (010), -40 Super Fibonacci Graceful Labeling R. Sridevi 1, S.Navaneethakrishnan and K.Nagarajan 1 1. Department of Mathematics, Sri S.R.N.M.College, Sattur - 66 0, Tamil
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationGraphs with prescribed star complement for the. eigenvalue.
Graphs with prescribed star complement for the eigenvalue 1 F. Ramezani b,a B. Tayfeh-Rezaie a,1 a School of Mathematics, IPM (Institute for studies in theoretical Physics and Mathematics), P.O. Box 19395-5746,
More informationOn Hamilton Decompositions of Infinite Circulant Graphs
On Hamilton Decompositions of Infinite Circulant Graphs Darryn Bryant 1, Sarada Herke 1, Barbara Maenhaut 1, and Bridget Webb 2 1 School of Mathematics and Physics, The University of Queensland, QLD 4072,
More informationSymmetric bowtie decompositions of the complete graph
Symmetric bowtie decompositions of the complete graph Simona Bonvicini Dipartimento di Scienze e Metodi dell Ingegneria Via Amendola, Pad. Morselli, 4100 Reggio Emilia, Italy simona.bonvicini@unimore.it
More informationPARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES
PARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES S.I. EL-ZANATI, G.F. SEELINGER, P.A. SISSOKHO, L.E. SPENCE, AND C. VANDEN EYNDEN Abstract. Let V n (q) denote a vector space of dimension n over the field
More informationPrimitive 2-factorizations of the complete graph
Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,
More informationG-invariantly resolvable Steiner 2-designs which are 1-rotational over G
G-invariantly resolvable Steiner 2-designs which are 1-rotational over G Marco Buratti Fulvio Zuanni Abstract A 1-rotational (G, N, k, 1) difference family is a set of k-subsets (base blocks) of an additive
More informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev arxiv:1504.07132v1 [math.gm] 23 Apr 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationWilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes
Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes Steiner systems S(2, k, v) For k 3, a Steiner system S(2, k, v) is usually defined as a pair (V, B), where V is a set
More informationIntroduction Inequalities for Perfect... Additive Sequences of... PDFs with holes and... Direct Constructions... Recursive... Concluding Remarks
Page 1 of 56 NSFC, Grant No. 1085103 and No. 10771193. 31th, July, 009 Zhejiang University Perfect Difference Families, Perfect Difference Matrices, and Related Combinatorial Structures Gennian Ge Department
More informationOn the cyclic decomposition of circulant graphs into almost-bipartite graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 61 76 On the cyclic decomposition of circulant graphs into almost-bipartite graphs Saad El-Zanati 4520 Mathematics Department Illinois State
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationOn the Gracefulness of Cycle related graphs
Volume 117 No. 15 017, 589-598 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu On the Gracefulness of Cycle related graphs S.Venkatesh 1 and S. Sivagurunathan
More informationOn cordial labeling of hypertrees
On cordial labeling of hypertrees Michał Tuczyński, Przemysław Wenus, and Krzysztof Węsek Warsaw University of Technology, Poland arxiv:1711.06294v3 [math.co] 17 Dec 2018 December 19, 2018 Abstract Let
More informationarxiv: v2 [cs.dm] 27 Jun 2017
H-SUPERMAGIC LABELINGS FOR FIRECRACKERS, BANANA TREES AND FLOWERS RACHEL WULAN NIRMALASARI WIJAYA 1, ANDREA SEMANIČOVÁ-FEŇOVČÍKOVÁ, JOE RYAN 1, AND THOMAS KALINOWSKI 1 arxiv:1607.07911v [cs.dm] 7 Jun 017
More informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationNear a-labelings of bipartite graphs*
Near a-labelings of bipartite graphs* S. I. EI-Zanati, M. J. Kenig and C. Vanden Eynden 4520 Mathematics Department Illinois State Univ:ersity Normal, Illinois 61790-4520, U.S.A. Abstract An a-labeling
More informationarxiv: v1 [math.co] 10 Nov 2016
Indecomposable 1-factorizations of the complete multigraph λk 2n for every λ 2n arxiv:1611.03221v1 [math.co] 10 Nov 2016 S. Bonvicini, G. Rinaldi November 11, 2016 Abstract A 1-factorization of the complete
More informationarxiv: v1 [math.co] 4 Jan 2018
A family of multigraphs with large palette index arxiv:80.0336v [math.co] 4 Jan 208 M.Avesani, A.Bonisoli, G.Mazzuoccolo July 22, 208 Abstract Given a proper edge-coloring of a loopless multigraph, the
More informationExistence of doubly near resolvable (v, 4, 3)-BIBDs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 109 124 Existence of doubly near resolvable (v, 4, 3)-BIBDs R. Julian R. Abel Nigel H. N. Chan School of Mathematics and Statistics University
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationGroup Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration
Group Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration Spencer P. Hurd Nutan Mishra and Dinesh G. Sarvate Abstract. We present constructions and results about GDDs with
More informationGiven any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer
Chapter 2 Topogenic Graphs Given any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer of G is an injective set-valued function f : V (G) 2 X such that the induced edge
More informationDifference Systems of Sets and Cyclotomy
Difference Systems of Sets and Cyclotomy Yukiyasu Mutoh a,1 a Graduate School of Information Science, Nagoya University, Nagoya, Aichi 464-8601, Japan, yukiyasu@jim.math.cm.is.nagoya-u.ac.jp Vladimir D.
More informationOn Odd Sum Graphs. S.Arockiaraj. Department of Mathematics. Mepco Schlenk Engineering College, Sivakasi , Tamilnadu, India. P.
International J.Math. Combin. Vol.4(0), -8 On Odd Sum Graphs S.Arockiaraj Department of Mathematics Mepco Schlenk Engineering College, Sivakasi - 66 00, Tamilnadu, India P.Mahalakshmi Department of Mathematics
More informationList Decomposition of Graphs
List Decomposition of Graphs Yair Caro Raphael Yuster Abstract A family of graphs possesses the common gcd property if the greatest common divisor of the degree sequence of each graph in the family is
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationOn Hamiltonian cycle systems with a nice automorphism group
On Hamiltonian cycle systems with a nice automorphism group Francesca Merola Università Roma Tre April Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationarxiv: v2 [math.co] 31 Mar 2010
arxiv:0907.3199v2 [math.co] 31 Mar 2010 ampling complete designs L. Giuzzi A. Pasotti Abstract uppose Γ to be of a subgraph of a graph Γ. We define a sampling of a Γ-design B = (V,B) into a Γ -design B
More informationOctagon Quadrangle Systems nesting 4-kite-designs having equi-indices
Computer Science Journal of Moldova, vol.19, no.3(57), 2011 Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices Luigia Berardi, Mario Gionfriddo, Rosaria Rota Abstract An octagon quadrangle
More information5-Chromatic Steiner Triple Systems
5-Chromatic Steiner Triple Systems Jean Fugère Lucien Haddad David Wehlau March 21, 1994 Abstract We show that, up to an automorphism, there is a unique independent set in PG(5,2) that meet every hyperplane
More informationH-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications () (014), 115 18 H-E-Super magic decomposition of graphs S. P. Subbiah a, J. Pandimadevi b a Department of Mathematics Mannar Thirumalai Naicker College
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationTransversal Designs in Classical Planes and Spaces. Aiden A. Bruen and Charles J. Colbourn. Computer Science. University of Vermont
Transversal Designs in Classical Planes and Spaces Aiden A. Bruen and Charles J. Colbourn Computer Science University of Vermont Burlington, VT 05405 U.S.A. Abstract Possible embeddings of transversal
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationSuper Fibonacci Graceful Labeling of Some Special Class of Graphs
International J.Math. Combin. Vol.1 (2011), 59-72 Super Fibonacci Graceful Labeling of Some Special Class of Graphs R.Sridevi 1, S.Navaneethakrishnan 2 and K.Nagarajan 1 1. Department of Mathematics, Sri
More informationA review on graceful and sequential integer additive set-labeled graphs
PURE MATHEMATICS REVIEW ARTICLE A review on graceful and sequential integer additive set-labeled graphs N.K. Sudev, K.P. Chithra and K.A. Germina Cogent Mathematics (2016), 3: 1238643 Page 1 of 14 PURE
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationTHE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q )
Volume 3, Number 1, Pages 47 51 ISSN 1715-0868 THE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q ) ANTONIO COSSIDENTE AND MARIALUISA J. DE RESMINI Dedicated to the centenary of the birth of Ferenc
More informationMixed cycle-e-super magic decomposition of complete bipartite graphs
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir Mixed cycle-e-super magic decomposition of complete bipartite graphs G. Marimuthu, 1 and S. Stalin Kumar 2 1 Department of Mathematics,
More informationOn Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs
Australian Journal of Basic and Applied Sciences, 5(9): 2042-2052, 2011 ISSN 1991-8178 On Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs 1 Gee-Choon Lau, 2 Sin-Min Lee, 3
More informationPacking chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph Boštjan Brešar a,b Douglas F. Rall d Sandi Klavžar a,b,c Kirsti Wash e a Faculty of Natural Sciences and Mathematics,
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationNote on group distance magic complete bipartite graphs
Cent. Eur. J. Math. 12(3) 2014 529-533 DOI: 10.2478/s11533-013-0356-z Central European Journal of Mathematics Note on group distance magic complete bipartite graphs Research Article Sylwia Cichacz 1 1
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationFurther results on relaxed mean labeling
Int. J. Adv. Appl. Math. and Mech. 3(3) (016) 9 99 (ISSN: 347-59) Journal homepage: www.ijaamm.com IJAAMM International Journal of Advances in Applied Mathematics and Mechanics Further results on relaxed
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationarxiv: v2 [math.co] 6 Apr 2016
On the chromatic number of Latin square graphs Nazli Besharati a, Luis Goddyn b, E.S. Mahmoodian c, M. Mortezaeefar c arxiv:1510.051v [math.co] 6 Apr 016 a Department of Mathematical Sciences, Payame Noor
More informationRadio Number for Square Paths
Radio Number for Square Paths Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003 Melanie Xie Department of Mathematics East Los Angeles College Monterey
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationOn p-hyperelliptic Involutions of Riemann Surfaces
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 46 (2005), No. 2, 581-586. On p-hyperelliptic Involutions of Riemann Surfaces Ewa Tyszkowska Institute of Mathematics, University
More informationGeneralizing Clatworthy Group Divisible Designs. Julie Rogers
Generalizing Clatworthy Group Divisible Designs by Julie Rogers A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Doctor
More informationThe Doyen-Wilson theorem for 3-sun systems
arxiv:1705.00040v1 [math.co] 28 Apr 2017 The Doyen-Wilson theorem for 3-sun systems Giovanni Lo Faro Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra Università
More informationA Solution to the Checkerboard Problem
A Solution to the Checkerboard Problem Futaba Okamoto Mathematics Department, University of Wisconsin La Crosse, La Crosse, WI 5460 Ebrahim Salehi Department of Mathematical Sciences, University of Nevada
More informationCircle Spaces in a Linear Space
Circle Spaces in a Linear Space Sandro Rajola and Maria Scafati Tallini Dipartimento di Matematica, Universitá di Roma La Sapienza, Piazzale Aldo Moro 2, 00185-ROMA, Italy. Abstract We study the circle
More informationFOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM ILYA KAPOVICH, ALEXEI MYASNIKOV, AND RICHARD WEIDMANN Abstract. We use Stallings-Bestvina-Feighn-Dunwoody folding sequences to analyze the solvability
More informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v2 [math.co] 10 Sep 2018 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501, India. K. A. Germina PG & Research
More informationarxiv: v2 [math.co] 31 Jul 2015
The rainbow connection number of the power graph of a finite group arxiv:1412.5849v2 [math.co] 31 Jul 2015 Xuanlong Ma a Min Feng b,a Kaishun Wang a a Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationThe number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes
The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes Vrije Universiteit Brussel jvpoucke@vub.ac.be joint work with K. Hicks, G.L. Mullen and L. Storme
More informationTopological Integer Additive Set-Graceful Graphs
Topological Integer Additive Set-Graceful Graphs N. K.Sudev arxiv:1506.01240v1 [math.gm] 3 Jun 2015 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501,
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationAvailable Online through
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com 0-EDGE MAGIC LABELING OF SHADOW GRAPH J.Jayapriya*, Department of Mathematics, Sathyabama University, Chennai-119,
More informationOdd-even sum labeling of some graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (017), 57-63. ISSN Print : 49-338 Odd-even sum labeling of some graphs ISSN Online : 319-515 K. Monika 1, K. Murugan 1 Department of
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationPrime Factorization and Domination in the Hierarchical Product of Graphs
Prime Factorization and Domination in the Hierarchical Product of Graphs S. E. Anderson 1, Y. Guo 2, A. Rubin 2 and K. Wash 2 1 Department of Mathematics, University of St. Thomas, St. Paul, MN 55105 2
More information