Matching Transversal Edge Domination in Graphs
|
|
- Andrew Rudolf Day
- 6 years ago
- Views:
Transcription
1 Available at htt://vamuedu/aam Al Al Math ISSN: Vol 11, Issue (December 016), Alications and Alied Mathematics: An International Journal (AAM) Matching Transversal Edge Domination in Grahs Anwar Alwardi Deartment of Studies in Mathematics University of Mysore, Manasagangotri Mysuru , India a_wardi@hotmailcom Received: November 19, 015; Acceted: August, 016 Abstract Let G ( V, E) be a grah A subset X of E is called an edge dominating set of G if every edge in E X is adacent to some edge in X An edge dominating set which intersects every maximum matching in G is called matching transversal edge dominating set The minimum cardinality of a matching transversal edge dominating set is called the matching transversal edge domination number of G and is denoted by In this aer, we begin an investigation of this arameter Keywords: Dominating set; Matching set; matching transversal dominating set; Matching transversal domination MSC 010 No: 05C69 1 Introduction By a grah G ( V, E), we mean a finite and undirected grah with no loos and multile edges As usual V and q E denote the number of vertices and edges of a grah G, resectively In general, we use X to denote the subgrah induced by the set of vertices X Nv () and Nv [] denote the oen and closed neighbourhood of a vertex v, resectively for any edge f E The degree of f uv in G is defined by deg(f) = deg(u) + deg(v) The 919
2 90 Anwar Alwardi oen neighbourhood and closed neighbourhood of an edge f in G, denoted by N( f ) and N[ f], resectively, are defined as N( f ) { g V: f and g areadacent} and N[ f ] N( f ) { f } The cardinality of N( f ) is called the degree of f and denoted by deg( f ) The maximum and minimum degree of edge in G are denoted, resectively by and That is, max f E N( f ), min f E N( f ) A set D of vertices in a grah G is a dominating set if every vertex in V D is adacent to some vertex in D The domination number is the minimum cardinality of a dominating set of G A line grah LG ( ) (also called an interchange grah or edge grah) of a simle grah G is obtained by associating a vertex with each edge of the grah and connecting two vertices with an edge, if and only if the corresonding edges of G have a vertex in common The Corona roduct G H of two grahs G and H is obtained by taking one coy of G and VG ( ) coies of H and by oining each vertex of the i -th coy of H to the i -th vertex of G, where 1 i V A matching M in G is a set of airwise non-adacent edges; that is, no two edges share a common vertex The matching number is the maximum cardinality of a matching of G and denoted by 1 A vertex is matched (or saturated) if it is an endoint of one of the edges in the matching; otherwise, the vertex is unmatched A maximal matching is a matching M of a grah G with the roerty that if any edge not in M is added to M, it is no longer a matching; that is, M is maximal if it is not a roer subset of any other matching in grah G In other words, a matching M of a grah G is maximal if every edge in G has a non-ey intersection with at least one edge in M The indeendent transversal domination was introduced by Hamid (01) A dominating set D in a grah G which intersects every maximum indeendent set in G is called indeendent transversal dominating set of G The minimum cardinality of an indeendent transversal dominating set is called indeendent transversal domination number of G and is denoted by it For terminology and notations not secifically defined here we refer reader to Harary (1969) For more details about domination number and its related arameters, we refer to Haynes et al (1998), Samathkumar et al (1985) and Walikar et al (1979) The concet of edge domination was introduced by Mitchell et al (1977) Let G ( V, E) be a grah A subset X of E is called an edge dominating set of G if every edge in E X is adacent to some edge in X In this aer, we introduce the concet of matching transversal domination in a grah and, exact values for some standard grahs, bounds and some interesting results are established Matching Transversal Edge Domination Number Definition 1 Let G = (V, E) be a grah An edge dominating set S which intersects every maximum matching in G is called matching transversal edge dominating set The minimum cardinality of a matching transversal edge dominating set is called the matching transversal edge domination
3 AAM: Intern J, Vol 11, Issue (December 016) 91 number of G and is denoted by γ (G) Theorem 1 For any ath P with, we have,, if or 4; ( P ), if 7; 1, otherwise ( ) {,,, } Obviously ( P) ( P4) Similarly, if 7, easily Let E P v1v vv v 1v we can see that, ( P7 ) Now suose that {,4,7}, then we have three cases Case 1: If 0(b mod), then the set of edges S { v i1v i :0 i 1} is a minimum edge dominating set of P Also the induced subgrah E S K P and every matching in E S contains at most maximum matching of P, then Case : If 1(mod ), then the set of edges edges and 1 ( P ) ( P ) 1 1( P ) 1 i1 i Hence, E S contains no S { v v :1 i } is a minimum edge dominating set of P Furthermore, the induced subgrah E S K P and every matching in 1 E S contains at most edges Now, since 1( P ), it follows 1 that E S contains no maximum matching of P, and then ( P ) ( P ) Case : If (mod ), then the set of edges dominating set of S { v v :0 i } is a minimum edge i1 i P Also, it is easy to check that the induced subgrah and every matching in E S contains at most E S P 1 1 edges and 1 1 1( P ) E S contains no maximum matching of P Thus, ( P ) ( P ) 1 So, Theorem
4 9 Anwar Alwardi For any cycle C of order, we have, =,5; ( C ), otherwise ( ) {,,,, } It is easy to see that ( C) ( C5) Suose that {,5}, then we have three cases: Let E C v1v vv v 1v vv1 Case 1: If 0(mod ), then the set of edges dominating set of in E S contains at most maximum matching of S { v v :0 i } is a minimum edge i1 i C Furthermore, the induced subgrah E S P and every matching edges and 1 1( C ) C, and then ( C) ( C) Case : If 1(mod ), then the set of edges dominating set of 1 i1 i C Also, it is easy to see that the induced subgrah Therefore, every matching in E S contains at most Hence, E S contains no S { v v : 0 i } is a minimum edge 1 edges and E S P 1 1 1( C ) E S contains no maximum matching of C Thus, ( C) ( C) Case : If (mod ), then the set of edges dominating set of E S contains at most matching of Proosition 1 C The induced subgrah 1 edges and C Then ( C) ( C) For any grah G, Observation 1 S { v v :0 i } is a minimum edge i1 i E S K P Hence, Hence, every matching in 1 1( C ) For any grah G with at least one edge, 1 q So, E S contains no maximum A bi-star is a tree obtained from the grah K with two vertices u and v by attaching m endant edges in u and n endant edges in v and denoted by B( m, n )
5 AAM: Intern J, Vol 11, Issue (December 016) 9 The roof of the following roosition is straightforward Proosition For any bi-star grah B mn,, ( Bm, n) min{ m, n} 1 Remark From the definition of and it is easy to observe that ( L), where LG ( ) is the line grah of G Theorem For any Comlete biartite grah K r,s, where r s, ( Kr, s) s it Let G = (V 1, V, E) be any comlete biartite grah K rs,, where V1 r, V s Suose that V 1 = {v 1, v,, v r }, V = {u 1, u,, u s } Let E, where i {1,,, r} is the set of edges which have v i as common vertex It is easy to check that any maximum matching of G contains one edge from each E v i Therefore, any Ev i set of edges is the minimum set which intersects each maximum matching of G and also it is an edge dominating set of G Without loss of generality, let D E { v u, v u, v u,, v u }, where D is an edge dominating set of G v s and intersects every maximum matching of G and with minimum size D s Hence ( K ) s r, s Proosition v i it For any cycle C, ( CP K1) P Theorem 4 If G ( V, E) is a grah with at least one isolated edge, then Let G ( V, E) be a grah with at least one isolated edge say e, and F is a minimum edge dominating set of G Evidently the edge e must belong to any dominating set and also to any matching of G Therefore, the minimum dominating set F intersects every maximum matching of G Hence, F is a minimum matching transversal edge dominating set of G Thus,
6 94 Anwar Alwardi Corollary 1 For any grah = H K, we have γ (G) = γ (G) We can generalize Theorem with the following theorem Theorem (generalized) Let G be a grah with the comonents G1, G,, G r Then, Suose that without loss of generality γ = min 1 i r {γ (G i ) + r =1, i γ (G )} r G1, i G 1 i r G i 1, i G ( ) ( ) min { ( ) ( )} Let S be the minimum matching transversal dominating set of G 1 and let minimum edge dominating set of A be the r G for all It is easy to check that, S ( A ) is a r matching edge dominating set of G Hence, ( G ) ( G ) 1 Conversely, let S be any minimum matching edge dominating set of G Then, S must intersect all the edge set EG ( ) of each comonent G of G and S E( G ) is edge dominating set of G for all 1 Furthermore, for at least one, the set S E( G ) must be matching edge dominating set of G, for otherwise each comonent G will have maximum matching not intersecting the set S E( G ) and hence the union of these maximum matching sets form a maximum matching of G not intersecting S r Hence, S min { ( G ) 1, i ( G )} Theorem 4 1 i r i For any connected grah G with q edges, q, if and only if G K1, 1 or K
7 AAM: Intern J, Vol 11, Issue (December 016) 95 or G K, then it is easy to see that q If G K1, 1 Conversely, let q Then either the minimum edge dominating set of G contains all the edges of G and hence G = mk and in this case since G is connected, then m = 1 which imlies that G K1,1, or the maximum matching has cardinality one, which means G is the comlete biartite grah K1, 1 or K Hence, G K1, 1 or G K Theorem 5 For any connected grah G, γ (G) = 1, if and only if G K If G = K, then it is clear that γ (G) = 1 Conversely, if γ (G) = 1, that means there exists an edge e in G with degree q 1 and e must belong to each maximum matching of G Then G K Theorem 6 Let G be a grah with q edges Then q 1, if and only if G P4 Let q 1 Then the matching number is greater than or equal two If there exist two adacent edges e and f of degree at least two, then S E { e, f } is a matching transversal edge dominating set of G and hence q which is a contradiction Therefore, for any two adacent edges either e or f endant edge Hence G P 4 Conversely, if G = P 4, then it holds that q 1 Theorem 7 Let a and b be any two ositive integers with ba 1 Then there exists a grah G with b edges such that a
8 96 Anwar Alwardi Let b a r, r 1 and let H be any star grah K 1,a with a edges Suose E( H) { e1, e,, e a } Let G be the grah obtained from H by attaching r 1 edges at the endant vertex of the edge e 1, and one endant edge at each endant vertex of the edge e i for i Let f i, where i be the endant edges in G adacent to ei, i It is easy to check that a and the set D { e1, f,, f a } is the minimum edge dominating set and D intersectd all the maximum matching of G Hence, a and E b Theorem 8 Let G ( V, E) be a grah with a unique maximum matching Then 1 Let G be a grah with a unique maximum matching S and let D be a minimum edge dominating set of G Let e be any edge in S Then D {} e is a matching transversal edge dominating set Hence 1 The converse of Theorem 8, is not true in general, for examle for G C4 we have that, but there are two maximum matching sets Theorem 9 For any grah G, we have Let f be an edge with degree deg( f) and let S be a minimum edge dominating set of G Every maximum matching of G contains an edge of N[ f ] Hence, S N[ f ] is a matching transversal edge dominating set of G We have also S intersects N[ f ], and it follows that S N[ f ] Hence, Let F 1 be the 5-vertex ath, F the grah obtained by identifying a vertex of a triangle with one end vertex of the -vertex ath, F the grah obtained by identifying a vertex of a triangle with a vertex of another triangle (See Figure 1)
9 AAM: Intern J, Vol 11, Issue (December 016) 97 F Figure 1: The family F1, F and F Theorem 10 (Raman et al (009)) If diam and if none of the three grahs F1, F and F of Figure l, is an induced subgrah of G, then diam( L) Theorem 11 Let G be a grah with diameter diam and none of the three grahs F1, F and F in Figure 1 is an induced subgrah of G Then 1 Let f be an edge with deg( f) Since diam it follows from Theorem 10 that diam( L) Then N[ f ] is an edge dominating set of G and every maximum matching contains an edge of N[ f ] Therefore, N[ f ] is a matching transversal edge dominating set Hence, 1 Theorem 1 For any ( q, ) grah G, q, if and only if each comonent of G is isomorhic to K Let q Then by (Jayaram, SR (1987)), G has q comonents, each
10 98 Anwar Alwardi of which is isomorhic to a star Also, since q, then each comonent contains only one edge Hence, each comonent of G is isomorhic to K Conversely, if each comonent of G is isomorhic to K, it is easy to check that q Conclusion In this aer, we define a new domination invariant called matching transversal edge domination in grahs which mixes the two imortant concets in Grah Theory, domination and matching Some imortant roerties and exact values for some standard grahs are obtained Also some bounds for this arameter and some relations with the other domination arameters are established As this aer is the first to investigate this arameter still there are many things to study in the future, like how to artition the edges into matching transversal edge domination sets with maximum size, how this arameter changes and unchanges by deleting edges, and similar to the standard domination, we can study this new arameter by studying total, connected, indeendent, slit, nonslit matching transversal edge domination in grahs Acknowledgment: The author is thankful to anonymous referees and the Editor-in-Chief, Professor Aliakbar Montazer Haghighi for useful comments and suggestions towards the imrovements of this aer REFERENCES Bondy, J and Murthy U (1976) Grah Theory with alications, North Holland, New York Godsil, C and Royle G (001) Algebraic grah theory, Vol 07 of Graduate Texts in Mathematics, Sringer-Verlag, New York Hamid, IS (01) Indeendent transversal Domination in Grahs, Grahs,Discussions Mathematicae Grah Theory, 5-17 Harary, F (1969) Grah theory, Reading Mass Haynes, TW, Hedetniemi ST and Slater, PJ (1998) Fundamentals of domination in grahs, Marcel Dekker, Inc, New York Jayaram, SR (1987) Line domination in grahs, Combin, 57-6 Mitchell, S, Hedetniemi, ST (1977) Edge domination in trees, Grah Theory and comuting, Congr Number, 19, Raman, HS, Revankar, DS, Gutman, I, and Walikar, HB (009) Distance sectra and distance energies of iterated line grahs of regular grahs, Publ Inst Math (Beograd),85, 9 46 Samathkumar, E, and Neeralagi, PS (1985) The neighborhood number of a grah, Indian J
11 AAM: Intern J, Vol 11, Issue (December 016) 99 Pure and Al Math, 16 (), 16-1 Walikar, HB, Acharya, BD, and Samathkumar, E (1979) Recent develoments in the theory of domination in grahs, Mehta Research Institute, Allahabad, MRI Lecture Notes in Math,1
ON THE INJECTIVE DOMINATION OF GRAPHS
Palestine Journal of Mathematics Vol. 7(1)(018), 0 10 Palestine Polytechnic Uniersity-PPU 018 ON THE INJECTIVE DOMINATION OF GRAPHS Anwar Alwardi, R. Rangarajan and Akram Alqesmah Communicated by Ayman
More informationIndependent Transversal Equitable Domination in Graphs
International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner
More informationThe Dominating Graph DG bcd (G) of a Graph G
The Dominating Grah (G) of a Grah G M. Bhanumathi 1, J. John Flavia 2 1 Associate Professor, Government Arts College for Women, Pudukkottai, TN, India 2 Research Scholar, Government Arts College for Women,
More informationDOMINATION IN DEGREE SPLITTING GRAPHS S , S t. is a set of vertices having at least two vertices and having the same degree and T = V S i
Journal of Analysis and Comutation, Vol 8, No 1, (January-June 2012) : 1-8 ISSN : 0973-2861 J A C Serials Publications DOMINATION IN DEGREE SPLITTING GRAPHS B BASAVANAGOUD 1*, PRASHANT V PATIL 2 AND SUNILKUMAR
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationLilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3
Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF
More informationRelations between edge removing and edge subdivision concerning domination number of a graph
arxiv:1409.7508v1 [math.co] 26 Sep 2014 Relations between edge removing and edge subdivision concerning domination number of a graph Magdalena Lemańska 1, Joaquín Tey 2, Rita Zuazua 3 1 Gdansk University
More informationChromaticity of Turán Graphs with At Most Three Edges Deleted
Iranian Journal of Mathematical Sciences and Informatics Vol. 9, No. 2 (2014), 45-64 Chromaticity of Turán Grahs with At Most Three Edges Deleted Gee-Choon Lau a, Yee-hock Peng b, Saeid Alikhani c a Faculty
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationarxiv: v1 [math.co] 23 Apr 2015
Connectivity of Double Grahs arxiv:504.0696v [math.co] 3 Ar 05 Zhayida Simayijiang and Elkin Vumar College of Mathematics and System Sciences Xinjiang University, Urumqi 830046, P.R.China Abstract The
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationClassification of rings with unit graphs having domination number less than four
REND. SEM. MAT. UNIV. PADOVA, Vol. 133 (2015) DOI 10.4171/RSMUP/133-9 Classification of rings with unit grahs having domination number less than four S. KIANI (*) - H. R. MAIMANI (**) - M. R. POURNAKI
More informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationPiotr Blass. Jerey Lang
Ulam Quarterly Volume 2, Number 1, 1993 Piotr Blass Deartment of Mathematics Palm Beach Atlantic College West Palm Beach, FL 33402 Joseh Blass Deartment of Mathematics Bowling Green State University Bowling
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationARTICLE IN PRESS Discrete Mathematics ( )
Discrete Mathematics Contents lists available at ScienceDirect Discrete Mathematics journal homeage: wwwelseviercom/locate/disc Maximizing the number of sanning trees in K n -comlements of asteroidal grahs
More informationA note on the total domination number of a tree
A note on the total domination number of a tree 1 Mustapha Chellali and 2 Teresa W. Haynes 1 Department of Mathematics, University of Blida. B.P. 270, Blida, Algeria. E-mail: m_chellali@yahoo.com 2 Department
More informationGENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS
GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS PALLAVI DANI 1. Introduction Let Γ be a finitely generated grou and let S be a finite set of generators for Γ. This determines a word metric on
More informationGaps in Semigroups. Université Pierre et Marie Curie, Paris 6, Equipe Combinatoire - Case 189, 4 Place Jussieu Paris Cedex 05, France.
Gas in Semigrous J.L. Ramírez Alfonsín Université Pierre et Marie Curie, Paris 6, Equie Combinatoire - Case 189, 4 Place Jussieu Paris 755 Cedex 05, France. Abstract In this aer we investigate the behaviour
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationk-equitable mean labeling
Joural of Algorithms ad Comutatio joural homeage: htt://jac.ut.ac.ir k-euitable mea labelig P.Jeyathi 1 1 Deartmet of Mathematics, Govidammal Aditaar College for Wome, Tiruchedur- 628 215,Idia ABSTRACT
More informationStrong Matching of Points with Geometric Shapes
Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationMath 751 Lecture Notes Week 3
Math 751 Lecture Notes Week 3 Setember 25, 2014 1 Fundamental grou of a circle Theorem 1. Let φ : Z π 1 (S 1 ) be given by n [ω n ], where ω n : I S 1 R 2 is the loo ω n (s) = (cos(2πns), sin(2πns)). Then
More informationMersenne and Fermat Numbers
NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM
More informationNew Information Measures for the Generalized Normal Distribution
Information,, 3-7; doi:.339/info3 OPEN ACCESS information ISSN 75-7 www.mdi.com/journal/information Article New Information Measures for the Generalized Normal Distribution Christos P. Kitsos * and Thomas
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationCommutators on l. D. Dosev and W. B. Johnson
Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 Commutators on l D. Dosev and W. B. Johnson Abstract The oerators on l which are commutators are those not of the form λi
More informationUnit Groups of Semisimple Group Algebras of Abelian p-groups over a Field*
JOURNAL OF ALGEBRA 88, 580589 997 ARTICLE NO. JA96686 Unit Grous of Semisimle Grou Algebras of Abelian -Grous over a Field* Nako A. Nachev and Todor Zh. Mollov Deartment of Algebra, Plodi Uniersity, 4000
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationGlobal Behavior of a Higher Order Rational Difference Equation
International Journal of Difference Euations ISSN 0973-6069, Volume 10, Number 1,. 1 11 (2015) htt://camus.mst.edu/ijde Global Behavior of a Higher Order Rational Difference Euation Raafat Abo-Zeid The
More informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More informationGENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES
GENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES Vladimir D. Samodivkin 7th January 2008 (Dedicated to Mihail Konstantinov on his 60th birthday) Abstract For a graphical property P and a graph G,
More informationIDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number 5, May 996 IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP TIM HSU (Communicated by Ronald M. Solomon) Abstract. We exhibit a simle
More informationON FREIMAN S 2.4-THEOREM
ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained
More informationISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia
#A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationAdditive results for the generalized Drazin inverse in a Banach algebra
Additive results for the generalized Drazin inverse in a Banach algebra Dragana S. Cvetković-Ilić Dragan S. Djordjević and Yimin Wei* Abstract In this aer we investigate additive roerties of the generalized
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More informationRobust hamiltonicity of random directed graphs
Robust hamiltonicity of random directed grahs Asaf Ferber Rajko Nenadov Andreas Noever asaf.ferber@inf.ethz.ch rnenadov@inf.ethz.ch anoever@inf.ethz.ch Ueli Peter ueter@inf.ethz.ch Nemanja Škorić nskoric@inf.ethz.ch
More informationGENERALIZED NORMS INEQUALITIES FOR ABSOLUTE VALUE OPERATORS
International Journal of Analysis Alications ISSN 9-8639 Volume 5, Number (04), -9 htt://www.etamaths.com GENERALIZED NORMS INEQUALITIES FOR ABSOLUTE VALUE OPERATORS ILYAS ALI, HU YANG, ABDUL SHAKOOR Abstract.
More informationA Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs
ISSN 974-9373 Vol. 5 No.3 (2) Journal of International Academy of Physical Sciences pp. 33-37 A Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs R. S. Bhat Manipal Institute
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationRestrained Independent 2-Domination in the Join and Corona of Graphs
Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3171-3176 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.711343 Restrained Independent 2-Domination in the Join and Corona of Graphs
More informationSUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP OF THE NORMALIZER OF. 2p, p is a prime and p 1 mod4
Iranian Journal of Science & Technology, Transaction A, Vol. 34, No. A4 Printed in the Islamic Reublic of Iran, Shiraz University SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP * m OF THE NORMALIZER OF S. KADER,
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCIT POOJA PATEL Abstract. This aer is an self-contained exosition of the law of uadratic recirocity. We will give two roofs of the Chinese remainder theorem and a roof of uadratic recirocity.
More informationDISCRIMINANTS IN TOWERS
DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationA structure theorem for product sets in extra special groups
A structure theorem for roduct sets in extra secial grous Thang Pham Michael Tait Le Anh Vinh Robert Won arxiv:1704.07849v1 [math.nt] 25 Ar 2017 Abstract HegyváriandHennecartshowedthatifB isasufficientlylargebrickofaheisenberg
More informationARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER
#A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu
More informationTHE SET CHROMATIC NUMBER OF RANDOM GRAPHS
THE SET CHROMATIC NUMBER OF RANDOM GRAPHS ANDRZEJ DUDEK, DIETER MITSCHE, AND PAWE L PRA LAT Abstract. In this aer we study the set chromatic number of a random grah G(n, ) for a wide range of = (n). We
More informationChanging and unchanging of Total Dominating Color Transversal number of Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 4, April 216, PP 44-49 ISSN 2347-37X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/1.2431/2347-3142.446
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationBent Functions of maximal degree
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Bent Functions of maximal degree Ayça Çeşmelioğlu and Wilfried Meidl Abstract In this article a technique for constructing -ary bent functions from lateaued functions
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More information#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS
#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationAn Overview of Witt Vectors
An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that
More informationApplicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi
More informationGENERALIZED FACTORIZATION
GENERALIZED FACTORIZATION GRANT LARSEN Abstract. Familiarly, in Z, we have unique factorization. We investigate the general ring and what conditions we can imose on it to necessitate analogs of unique
More informationSOME TRACE INEQUALITIES FOR OPERATORS IN HILBERT SPACES
Kragujevac Journal of Mathematics Volume 411) 017), Pages 33 55. SOME TRACE INEQUALITIES FOR OPERATORS IN HILBERT SPACES SILVESTRU SEVER DRAGOMIR 1, Abstract. Some new trace ineualities for oerators in
More informationp-adic Measures and Bernoulli Numbers
-Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,
More informationP -PARTITIONS AND RELATED POLYNOMIALS
P -PARTITIONS AND RELATED POLYNOMIALS 1. P -artitions A labelled oset is a oset P whose ground set is a subset of the integers, see Fig. 1. We will denote by < the usual order on the integers and < P the
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationHARMONIC EXTENSION ON NETWORKS
HARMONIC EXTENSION ON NETWORKS MING X. LI Abstract. We study the imlication of geometric roerties of the grah of a network in the extendibility of all γ-harmonic germs at an interior node. We rove that
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationSome New Approaches for Computation of Domination Polynomial of Specific Graphs
Journal of Mathematical Extension Vol. 8, No. 2, (2014), 1-9 Some New Approaches for Computation of Domination Polynomial of Specific Graphs S. Alikhani Yazd University E. Mahmoudi Yazd University M. R.
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 12
8.3: Algebraic Combinatorics Lionel Levine Lecture date: March 7, Lecture Notes by: Lou Odette This lecture: A continuation of the last lecture: comutation of µ Πn, the Möbius function over the incidence
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationFactor Rings and their decompositions in the Eisenstein integers Ring Z [ω]
Armenian Journal of Mathematics Volume 5, Number 1, 013, 58 68 Factor Rings and their decomositions in the Eisenstein integers Ring Z [ω] Manouchehr Misaghian Deartment of Mathematics, Prairie View A&M
More informationTransactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationSmall Zeros of Quadratic Forms Mod P m
International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal
More informationExamples from Elements of Theory of Computation. Abstract. Introduction
Examles from Elements of Theory of Comutation Mostafa Ghandehari Samee Ullah Khan Deartment of Comuter Science and Engineering University of Texas at Arlington, TX-7609, USA Tel: +(87)7-5688, Fax: +(87)7-784
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationDIFFERENTIAL GEOMETRY. LECTURES 9-10,
DIFFERENTIAL GEOMETRY. LECTURES 9-10, 23-26.06.08 Let us rovide some more details to the definintion of the de Rham differential. Let V, W be two vector bundles and assume we want to define an oerator
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationOn a note of the Smarandache power function 1
Scientia Magna Vol. 6 200, No. 3, 93-98 On a note of the Smarandache ower function Wei Huang and Jiaolian Zhao Deartment of Basis, Baoji Vocational and Technical College, Baoji 7203, China Deartment of
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More information#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.
#A6 INTEGERS 15A (015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I Katalin Gyarmati 1 Deartment of Algebra and Number Theory, Eötvös Loránd University and MTA-ELTE Geometric and Algebraic Combinatorics
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationCharacterization of total restrained domination edge critical unicyclic graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 77 82 Characterization of total restrained domination edge critical unicyclic graphs Nader Jafari Rad School of Mathematics Institute for Research
More information#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS
#A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom
More informationNORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH
Discussiones Mathematicae Graph Theory 30 (2010 ) 257 263 NORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH Magdalena Lemańska Department of Applied Physics and Mathematics Gdańsk
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More information3 Properties of Dedekind domains
18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following
More informationIntroduction to Banach Spaces
CHAPTER 8 Introduction to Banach Saces 1. Uniform and Absolute Convergence As a rearation we begin by reviewing some familiar roerties of Cauchy sequences and uniform limits in the setting of metric saces.
More information