Z Halkası Üzerinde Nilpotent Grafların Laplasyan Spektral Özellikleri Sezer Sorgun *1, H. Pınar Cantekin 2

Size: px
Start display at page:

Download "Z Halkası Üzerinde Nilpotent Grafların Laplasyan Spektral Özellikleri Sezer Sorgun *1, H. Pınar Cantekin 2"

Transcription

1 Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Vol(No): pp, year SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: X Dergi sayfası: Geliş/Received Kabul/Accepted Doi Z Halkası Üzerinde Nilpotent Grafların Laplasyan Spektral Özellikleri Sezer Sorgun *1, H. Pınar Cantekin 2 ÖZ birimli bir halka olsun. ' nin ile gösterilen nilpotent grafı, = { : ç } noktalar kümesi ve, halkasının bütün nilpotent elemanlarının kümesi olmak üzere; iki farklı ve noktaları komşudur önermesini sağlayan kenarlar kümesinden oluşur. Bu makalede Z halkası üzerinde tanımlanan nilpotent grafın Laplasyan spektral özellikleri incelenmektedir. Anahtar Kelimeler: Nilpotent graf, Laplasyan matris, Spektrum ABSTRACT We consider a ring with unity. The nilpotent graph of is a graph with vertex set = { : }; and two distinct vertices and are adjacent iff, where is the set of all nilpotent elements of and it is denoted by. In this paper we study Laplacian spectral properties of the nilpotent graph over the ring Z. Keywords: Nilpotent Graph, Laplacian matrix, Spectrum * Sorumlu Yazar / Corresponding Author 1 Nevşehir HBV Üniversitesi, Fen Edebiyat Fakültesi, Matematik Bölümü NEVŞEHİR-srgnrzs@gmail.com 2 Nevşehir HBV Üniversitesi, Fen Edebiyat Fakültesi Matematik Bölümü NEVŞEHİR- pinarcantekin007@gmail.com 2017 Sakarya Üniversitesi Fen Bilimleri Enstitüsü

2 1. INTRODUCTION Let = (, ) be a graph with vertex set = {,,,, } and edge set. The degree of a vertex is the number of vertices which adjacent to and denoted by. The set of neighbors of is denoted by. Let max = and min =. When = (, ) and = (, ) are given graphs on disjoint sets of vertices, their union is the graph + = (, ). The join,, is the graph obtained from + by adding new edges from each vertex of to every vertex of. A complete split graph is a graph on vertices consisting of a clique on vertices and a stable set on the remaining vertices in which each vertex of the clique is adjacent to each vertex of the independent set and denoted by (, ). The Laplacian matrix of a graph is denoted by =, where = (,,, ) and are the diagonal matrix of vertex degrees and (0,1) adjacency matrix of, respectively. It is well known that is positive semidefinite symmetric and singular. Its eigenvalues of are denoted by, 1 and these eigenvalues can be ordered by = 0. The Laplacian spectrum of the graph and the Laplacian characteristic polynomial are defined by = {,,, } and Φ, respectively. Recently, one of the interesting research topic has become the combination some algebraic structures and graph. There can be found a lot of papers on connecting a graph to a ring [1-7]. We consider a ring with unity. The nilpotent graph of a ring is introduced in [5]. That is; the nilpotent graph of a ring is a graph with vertex set = {0 : forsome 0 } such that two distinct vertices and are adjacent iff and denoted by Γ. When given the ring = Z, it is well known that it has a nonzero nilpotent element if and only if is divisible by the square of some primes. From this fact, Z does not have any non-zero nilpotent element when is prime or =. Also, it is easily seen that (Z ) = {0,, 2,, ( 1) } (1) when =, > 1 and ( ), 2( ), (Z ) = (2), ( 1)( ) when =, 2. In literature, although there are a few studies related to graph parameters such as diameter, girth, etc. on the nilpotent graph, there is no study on the (Laplacian) spectral properties of the nilpotent graphs. In this paper we use the nilpotent graph over the Z ring for all and examine Laplacian spectral properties of it. We have seen that almost all Laplacian eigenvalues of the graph are exactly the degrees of the vertex (of course, integers). 2. MAIN RESULTS Lemma 2.1. Let Z be integer ring, where = and is a prime number. Then, the vertex set of Γ (Z ) is (Z ) = Z (3) Moreover, we have = 2 for (Z ) and = 1 for (Z ). We have (Z ) = 0,, 2, 3,, ( 1), where is a prime number such that. Let Z. Then, (Z ) since is nilpotent element of Z for all (Z ), we get (Z ). Hence Z (Z ). It is clear that (Z ) Z from the definition of the vertex set of a nilpotent graph. Hence, we get (Z ) = Z. It is easy to see = 2 for (Z ) by the same arguments above. Now let us show that = 1 for (Z ). Let (Z ) and any Z. There are two cases. Case 1: (Z ). In this case, we say that is nilpotent ( ) for all Z. Then, we have = { : (Z )} = 1. Case 2: Z. Now we consider that (Z ). Then, =, where 1 1. Hence Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol., no. : pp, year 2

3 or. If, then (Z ). But this is a contradiction that (Z ). Similarly, if, then we get the same contradiction to (Z ). Therefore, we have (Z ), that's;. Consequently, we get = { : (Z )} = 1. (4) for all (Z ). Remark 2.2. By Lemma 2.1, we see that Γ (Z ) has two distinct degrees such that Δ = 2 and = 1. Theorem 2.3. If is a prime number then Γ Z = (0,, (Δ + 1) ) (5) where Δ = 2 and = 1. Let =,,,,,, be eigenvector corresponding to any eigenvalue for L(Γ (Z )). We have = (6) = : (7) for = 1,,,, 1. Now we consider vectors = such that (Z ) and = 1 for all other Z and hence we get ( 1)-vectors as ( 1,, 1,, 1,, 1), ( 1,, 1,, ( 1,, 1,, 1,, 1),..., 1,, 1). These vectors are the characteristic eigenvectors corresponding eigenvalue 1 of Γ Z and each provide the equality in (7). Since all vectors above are linear independent, the algebraic multiplicity of the eigenvalue 1 is ( 1). By Remark 2.2, we get that Δ + 1 is the eigenvalue with 1 multiplicity. Similarly, we consider vectors as = 1 such that (Z ) and = 1 for only one,. We get, 1 = 1 Therefore we choose ( 1) linear independent vectors as 1,0,,0, 1, 0,,0,, 0,,0, 1, 0,,0, 1, 0,,0 (8) Each vectors provide the equality in (7) and they are also the characteristic eigenvectors corresponding eigenvalue ( 1) of Γ Z. By again Remark 2.2, we get that Δ + 1 is the eigenvalue with Δ + 1 multiplicity. On the other hand, it is well known that vector = (1,1,,1) is an eigenvector corresponding eigenvalue 0. Hence we get the result of the theorem. Lemma 2.4. [8] Let be a connected graph on vertices, then has three distinct eigenvalues 0,,,,,, and, with multiplicities and if and only if i. ( 1), ii. + 1, iii. =, where is isolated vertices with multiplicity. Remark 2.5. The graph Z has three distinct eigenvalues. Hence, by Lemma 2.4., we get Z (, ). Lemma 2.6. Let Γ (Z )be graph, where =, 2. i. If = 1 for each, then (Z ) = (9) where = { :1 1} and = {1,2,, }. ii. If 2 for at least, then (Z ) = Z (10) i. Let = 1 for each. In this case, there is no non zero nilpotent element of Z. That's; (Z ) = {0}. Let 0 (Z ). From the definition of the vertices set for nilpotent graphs, there is a non-zero element Z such that = 0. (11) By (11), we get and hence (Z ). It is also clear that (Z ). From these inclusions, we have the required result. ii. If 2 for at least, then we have (Z ) = {( ), 2( ),, Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol., no. : pp, year 3

4 ( 1)( )} by (2). Then, it is easily shown that each non-zero class of Z is adjacent to any nilpotent element. This completes the result. Remark 2.7. From Lemma 2.6. (i)., we can easily see that the number of vertices of Γ (Z ) is 1, where is the number of positive divisors of. Particularly, Γ (Z ), for, primes and Γ (Z ), where is a null graph. Lemma 2.8. Let's consider the graph Γ (Z ), where =, 2. i. = 2 for all (Z ) ii. If for (Z ) such that,, for 1 and = {1,2,, }, then we get =, 2,, 1 (12) = 1 (13) where = for every {,, }; and are the degree of vertex and the set of neighbors of, respectively. iii. If (, ) = 1 for all 1, then we get = (Z ) = {( ), 2( ),, ( 1)(( )} (14) = 1 (15) i. By similar method in Lemma 2.1., for all (Z ), is also nilpotent element of Z such that (Z ). Then; ~ for every. That is; = { : Z } (16) = 2 (17) ii. It is clear that ~ under the mentioned conditions. iii. If (, ) = 1, ~ for any Z if and only if (Z ). From this fact, we get the result directly. Theorem 2.9. Let Z be a ring, where =. Then we have ( Φ ( (Z )) = ) ( + 2) where = ( ), =, ( ),..., =, ( ) and is any polynomial such that is the cardinality of the set { Z : = }; (, ) = 1 for 1 and is Euler's totient function. We consider at least 2. Let be eigenvector corresponding to for (Γ (Z )). We have = = : (19) for (Z ). There are three cases for vertex from Lemma 2.8. Let (Z ). We consider = 1 and = 1 for one (Z ). Hence these ( 1)-vectors are the characteristic vectors corresponding to eigenvalue = 2 (by Lemma 2.8.(i).) and provide equality in (19). Let (, ) = 1, 1. Then we get = 1 from Lemma 2.7.iii.. Similarly, if we consider vectors = 1 and = 1 for one (Z ), such that = and (, ) = 1. Since =, hence there are -class which are relative prime. The other arguments can be shown by the same methods. APPENDICES Now we give Laplacian spectrum of the nilpotent graph over ring Z, for As seen below table, almost all Laplacian eigenvalues of the graphs are the integers. n Laplacian Spectrum of Γ (Z ) 4 {0, 1, 3} 8 {0, 3, 7 } 9 {0, 2, 8 } 12 {0, 1, 5, 7, 11 } 16 {0, 7, 15 } 18 {0, 2, 5, 8, 11, 17 } 20 {0, 1, 3, 9, 11, 19 } 24 {0, 3, 7, 11, 15, 23 } 25 {0, 4, 24 } 27 {0, 8, 26 } 28 {0, 1, 3, 13, 15, 27 } 32 {0, 15, 31 } 36 {0, 5, 11, 17, 15, 23, 35 } 40 {0, 3, 7, 19, 23, 39 } 44 {0, 1, 3, 21, 23, 43 } 45 {0, 2, 8, 14, 20, 44 } 48 {0, 7, 15, 23, 31, 47 } 49 {0, 6, 48 } Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol., no. : pp, year 4

5 n Laplacian Spectrum of Γ (Z ) 50 {0, 4, 9, 24, 29, 49 } 54 {0, 8, 17, 26, 35, 53 } 56 {0, 3, 7, 27, 31, 55 } {0,1, , 3, 4.4, 5, 9, 11, 13.3, 19, 23.6, 29, 31.26, 59 } 63 {0, 2, 8, 20, 26, 62 } 72 {0, 11, 23, 35, 47, 71 } 75 {0, 4, 14, 24, 34, 74 } 80 {0, 7, 15, 39, 47, 78 } 81 {0, 25, 80 } 88 {0, 3, 7, 43, 47, 87 } {0, 2 90, 3.94, 5, 7.16, 8, 14, 17, 20.45, 29, 36.04, 44, 47.39, 89 } 98 {0, 6, 13, 48, 55, 97 } 99 {0, 2, 8, 32, 38, 98 } 100 {0, 9, 19, 49, 59, 99 } REFERENCES [1] D.F. Anderson, P.S. Livingston, "The zerodivisor graph of a commutative ring", J. Algebra, vol. 217, pp , [2] D.F. Anderson, A. Badawi, "The total graph of a commutative ring", J. Algebra, vol. 320, pp , [3] M.J.Nikmehr, S.Khojasteh, "On the nilpotent graph of a ring", Turkish Journal of Mathematics, vol. 37, pp , [4] P. Sharma, A.Sharma, R.K. Vats, "Analysis of Adjacency Matrix and Neighborhood Associated with Zero Divisor Graph of Finite Commutative Rings", International Journalof Computer Applications, vol. 13 pp , [5] P.W. Chen, A kind of graph structure of rings, Algebra Colloq., vol. 10 (2),pp , [6] S. Akbari, A. Mohammadian, "Zerodivisor graphs of non-commutative rings", J. Algebra, vol. 296, pp , [7] S.Akbari, A. Mohammadian, "On zerodivisor graphs of finite rings", J. Algebra, vol. 13, pp , [8] S. J. Kirkland, "Completion of Laplacian integral graphs via edge additions", Discrete Math, vol. 295, pp , Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol., no. : pp, year 5

Some New Equalities On The Intuitionistic Fuzzy Modal Operators

Some New Equalities On The Intuitionistic Fuzzy Modal Operators SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 147-835X Dergi sayfası:http://dergipark.gov.tr/saufenbilder Geliş/Received Kabul/Accepted Doi Some New

More information

Jordan Left Derivations On Completely PrimeGamma Rings Y. CEVEN

Jordan Left Derivations On Completely PrimeGamma Rings Y. CEVEN C.Ü. Fen-Edebiyat Fakültesi Fen Bilimleri Dergisi (2002)Cilt 23 Sayı 2 Jordan Left Derivations On Completely PrimeGamma Rings Y. CEVEN C. Ü. Fen-Edebiyat Fakültesi Matematik Bölümü, 58140 SİVAS email:

More information

New predictor-corrector type iterative methods for solving nonlinear equations

New predictor-corrector type iterative methods for solving nonlinear equations SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 2147-835X Dergi sayfası: http://dergipark.gov.tr/saufenbilder Geliş/Received 11.12.2016 Kabul/Accepted

More information

A different approach for almost sequence spaces defined by a generalized weighted means

A different approach for almost sequence spaces defined by a generalized weighted means Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi 2 (6) 529~536 207 SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 247-835X Dergi sayfası: http://dergipark.gov.tr/saufenbilder

More information

Extremal Graphs for Randić Energy

Extremal Graphs for Randić Energy MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 (2017) 77-84 ISSN 0340-6253 Extremal Graphs for Randić Energy Kinkar Ch. Das, Shaowei Sun Department

More information

ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING

ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 39 2018 (128 139) 128 ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING N. Jahanbakhsh Basharlou Department of Mathematics Karaj Branch

More information

FACTOR GRAPH OF NON-COMMUTATIVE RING

FACTOR GRAPH OF NON-COMMUTATIVE RING International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 9, Issue 6, November - December 2018, pp. 178 183, Article ID: IJARET_09_06_019 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=9&itype=6

More information

Total Graph and Complemented Graph of a Rough Semiring

Total Graph and Complemented Graph of a Rough Semiring Gazi University Journal of Science GU J Sci 29(2):459-466 (2016) Total Graph and Complemented Graph of a Rough Semiring B.PRABA 1, A. MANIMARAN 2,, V. M. CHANDRASEKARAN 2 1 SSN College of Engineering,

More information

Some Expressions for the Group Inverse of the Block Partitioned Matrices with an Invertible Subblock

Some Expressions for the Group Inverse of the Block Partitioned Matrices with an Invertible Subblock Ordu University Journal of Science and Technology/ Ordu Üniversitesi ilim ve Teknoloji Dergisi Ordu Univ. J. Sci. Tech., 2018; 8(1): 100-113 Ordu Üniv. il. Tek. Derg., 2018; 8(1): 100-113 e-issn: 2146-6459

More information

A Uniqueness the Theorem for Singular Sturm-Liouville Problem

A Uniqueness the Theorem for Singular Sturm-Liouville Problem C.Ü. Fen-Edebiyat Fakültesi Fen Bilimleri Dergisi 3Cilt Sayı A Uniqueness the Theorem for Singular Sturm-Liouville Problem Etibar S. PANAKOV and ikmet KOYUNBAKAN Firat University Department of Mathematics

More information

Zero-Divisor Graph with Respect to an Ideal *

Zero-Divisor Graph with Respect to an Ideal * Zero-Divisor Graph with Respect to an Ideal * H. R. Maimani, M. R. Pournaki, S. Yassemi Abstract Let R be a commutative ring with nonzero identity and let I be an ideal of R. The zero-divisor graph of

More information

Approximation By Three-Dimensional q-bernstein-chlodowsky Polynomials

Approximation By Three-Dimensional q-bernstein-chlodowsky Polynomials Sakarya University Journal of Science 22 (6) 1774-1786 2018. SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 2147-835X Dergi sayfası:http://www.saujs.sakarya.edu.tr

More information

On the dot product graph of a commutative ring

On the dot product graph of a commutative ring Ayman Badawi American University of Sharjah, Sharjah, UAE September 25, 2014 Definition Let R be a commutative ring with nonzero identity, and let Z(R) be its set of zero-divisors. Recently, there has

More information

Domination and Independence Numbers of Γ(Z n )

Domination and Independence Numbers of Γ(Z n ) International Mathematical Forum, 3, 008, no. 11, 503-511 Domination and Independence Numbers of Γ(Z n ) Emad E. AbdAlJawad and Hasan Al-Ezeh 1 Department of Mathematics, Faculty of Science Jordan University,

More information

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues

More information

Orthogonality graph of the algebra of upper triangular matrices *

Orthogonality graph of the algebra of upper triangular matrices * Orthogonality graph of the algebra of upper triangular matrices * arxiv:602.03236v [math.co] 0 Feb 206 B.R. Bakhadly Lomonosov Moscow State University, Faculty of Mechanics and Mathematics Abstract We

More information

SOME ASPECTS OF PRIME GRAPH OF SOME RINGS

SOME ASPECTS OF PRIME GRAPH OF SOME RINGS SOME ASPECTS OF PRIME GRAPH OF SOME RINGS An Abstract Submitted to Gauhati University for the Degree of Doctor of Philosophy in Mathematics in the Faculty of Science Submitted by Sanjoy Kalita 2014 SYNOPSIS

More information

Araştırma Makalesi / Research Article Iğdır Üni. Fen Bilimleri Enst. Der. / Iğdır Univ. J. Inst. Sci. & Tech. 7(4): , 2017

Araştırma Makalesi / Research Article Iğdır Üni. Fen Bilimleri Enst. Der. / Iğdır Univ. J. Inst. Sci. & Tech. 7(4): , 2017 Araştırma Makalesi / Research Article Iğdır Üni. Fen Bilimleri Enst. Der. / Iğdır Univ. J. Inst. Sci. & Tech. 7(4): 189-201, 2017 Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi Iğdır University Journal

More information

Communications in Algebra Publication details, including instructions for authors and subscription information:

Communications in Algebra Publication details, including instructions for authors and subscription information: This article was downloaded by: [Cameron Wickham] On: 21 July 2011, At: 21:08 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer

More information

ON QUASI-ZERO DIVISOR GRAPHS OF NON-COMMUTATIVE RINGS. Communicated by S. Alikhani

ON QUASI-ZERO DIVISOR GRAPHS OF NON-COMMUTATIVE RINGS. Communicated by S. Alikhani Algebraic Structures and Their Applications Vol. 5 No. 2 (2018 ) pp 1-13. ON QUASI-ZERO DIVISOR GRAPHS OF NON-COMMUTATIVE RINGS RAZIEH AMIRJAN AND EBRAHIM HASHEMI Communicated by S. Alikhani Abstract.

More information

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group CAUCHY JURNAL MATEMATIKA MURNI DAN APLIKASI Volume 4 (4) (017), Pages 176-18 p-issn: 086-038; e-issn: 477-3344 On the Spectra of Commuting and Non Commuting Graph on Dihedral Group Abdussakir 1, Rivatul

More information

INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS

INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS YONGWEI YAO Abstract. For any commutative ring R that is not a domain, there is a zerodivisor graph, denoted Γ(R), in which the vertices are the nonzero zero-divisors

More information

Graph fundamentals. Matrices associated with a graph

Graph fundamentals. Matrices associated with a graph Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n

More information

Perfect Zero-Divisor Graphs of Z_n

Perfect Zero-Divisor Graphs of Z_n Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 2 Article 6 Perfect Zero-Divisor Graphs of Z_n Bennett Smith Illinois College Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj

More information

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d

More information

Automorphisms of Klein Surfaces of Algebraic Genus One

Automorphisms of Klein Surfaces of Algebraic Genus One Çankaya Üniversitesi Fen-Edebiyat Fakültesi, Journal of Arts and Sciences Say : 5, May s 006 Automorphisms of Klein Surfaces of Algebraic Genus One Adnan MELEKOĞLU * Abstract Klein surfaces of algebraic

More information

Unit Graph of Some Finite Group Z n, C n and D n

Unit Graph of Some Finite Group Z n, C n and D n Unit Graph of Some Finite Group Z n, C n and D n A. D. Godase Department of Mathematics, V. P. College, Vaijapur, Aurangabad - 423701. (Maharashtra, India) ashokgodse2012@gmail.com Abstract We represent

More information

arxiv: v1 [math.co] 3 May 2013

arxiv: v1 [math.co] 3 May 2013 arxiv:1305.0601v1 [math.co] 3 May 2013 On the Cayley graph of a commutative ring with respect to its zero-divisors G. Aalipour a,b and S. Akbari a,b a Department of Mathematical Sciences, Sharif University

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x

More information

Prime and irreducible elements of the ring of integers modulo n

Prime and irreducible elements of the ring of integers modulo n Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract

More information

Çarpımsal Türevli Asal Yakın Halkalar Üzerine Notlar

Çarpımsal Türevli Asal Yakın Halkalar Üzerine Notlar Cumhuriet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt 38, o. (017) ISS: 1300-1949 Cumhuriet Universit Facult of Science Science Journal (CSJ), Vol. 38, o. (017) ISS: 1300-1949 http://x.oi.org/10.17776/cumuscij.90566

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information

Zero-Divisor Graphs of Idealizations with Respect to Prime Modules

Zero-Divisor Graphs of Idealizations with Respect to Prime Modules Int. J. Contemp. Math. Sciences, Vol. 2, 2007, no. 26, 1279-1283 Zero-Divisor Graphs of Idealizations with Respect to Prime Modules Shahabaddin Ebrahimi Atani Department of Mathematics University of Guilan

More information

Extremal graph on normalized Laplacian spectral radius and energy

Extremal graph on normalized Laplacian spectral radius and energy Electronic Journal of Linear Algebra Volume 9 Special volume for Proceedings of the International Conference on Linear Algebra and its Applications dedicated to Professor Ravindra B. Bapat Article 16 015

More information

ON THE ZERO-DIVISOR GRAPH OF A RING

ON THE ZERO-DIVISOR GRAPH OF A RING Communications in Algebra, 36: 3073 3092, 2008 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870802110888 ON THE ZERO-DIVISOR GRAPH OF A RING David F. Anderson

More information

arxiv: v1 [math.co] 31 Oct 2017

arxiv: v1 [math.co] 31 Oct 2017 arxiv:1711.00374v1 [math.co] 31 Oct 2017 Graph classes for critical ideals, minimum rank and zero forcing number Carlos A. Alfaro September 19, 2018 Abstract Recently, there have been found new relations

More information

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013 Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name

More information

Eigenvalues and edge-connectivity of regular graphs

Eigenvalues and edge-connectivity of regular graphs Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this

More information

Cographs; chordal graphs and tree decompositions

Cographs; chordal graphs and tree decompositions Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs

More information

A GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis

A GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis International Electronic Journal of Algebra Volume 20 (2016) 111-135 A GENERAL HEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUAIVE RING David F. Anderson and Elizabeth F. Lewis Received: 28 April 2016 Communicated

More information

Torsion Graph of Modules

Torsion Graph of Modules E extracta mathematicae Vol. 26, Núm. 1, 153 163 (2011) Torsion Graph of Modules Sh. Ghalandarzadeh, P. Malakooti Rad Department of Mathematics, Faculty of Science, K. N. Toosi University of Technology,

More information

Some results on the reduced power graph of a group

Some results on the reduced power graph of a group Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram

More information

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an

More information

Ring Sums, Bridges and Fundamental Sets

Ring Sums, Bridges and Fundamental Sets 1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G

More information

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime

More information

Name: Solutions Final Exam

Name: Solutions Final Exam Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of

More information

On the torsion graph and von Neumann regular rings

On the torsion graph and von Neumann regular rings Filomat 26:2 (2012), 253 259 DOI 10.2298/FIL1202253M Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the torsion graph and von

More information

PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.

PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof. PGSS Discrete Math Solutions to Problem Set #4 Note: signifies the end of a problem, and signifies the end of a proof. 1. Prove that for any k N, there are k consecutive composite numbers. (Hint: (k +

More information

ACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms

ACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms 1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge

More information

THE ZERO-DIVISOR GRAPH OF A MODULE

THE ZERO-DIVISOR GRAPH OF A MODULE Journal of Algebraic Systems Vol. 4, No. 2, (2017), pp 155-171 DOI: 10.22044/jas.2017.858 THE ZERO-DIVISOR GRAPH OF A MODULE A. R. NAGHIPOUR Abstract. Let R be a commutative ring with identity and M an

More information

Diameter and girth of Torsion Graph

Diameter and girth of Torsion Graph DOI: 10.2478/auom-2014-0054 An. Şt. Univ. Ovidius Constanţa Vol. 22(3),2014, 127 136 Diameter and girth of Torsion Graph P. Malakooti Rad 1, S. Yassemi 2, Sh. Ghalandarzadeh 3, P. Safari Abstract Let R

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

Algebraically defined graphs and generalized quadrangles

Algebraically defined graphs and generalized quadrangles Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number

More information

The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices

The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn

More information

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications What is discrete math? Propositional Logic The real numbers are continuous in the senses that: between any two real numbers there is a real number The integers do not share this property. In this sense

More information

Eight theorems in extremal spectral graph theory

Eight theorems in extremal spectral graph theory Eight theorems in extremal spectral graph theory Michael Tait Carnegie Mellon University mtait@cmu.edu ICOMAS 2018 May 11, 2018 Michael Tait (CMU) May 11, 2018 1 / 1 Questions in extremal graph theory

More information

On zero divisor graph of unique product monoid rings over Noetherian reversible ring

On zero divisor graph of unique product monoid rings over Noetherian reversible ring Volume 4, Number 1, February 2016, 95-113 On zero divisor graph of unique product monoid rings over Noetherian reversible ring E. Hashemi, A. Alhevaz, and E. Yoonesian Abstract. Let R be an associative

More information

MATH 829: Introduction to Data Mining and Analysis Clustering II

MATH 829: Introduction to Data Mining and Analysis Clustering II his lecture is based on U. von Luxburg, A Tutorial on Spectral Clustering, Statistics and Computing, 17 (4), 2007. MATH 829: Introduction to Data Mining and Analysis Clustering II Dominique Guillot Departments

More information

On Hadamard Diagonalizable Graphs

On Hadamard Diagonalizable Graphs On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization

More information

On Total Domination Polynomials of Certain Graphs

On Total Domination Polynomials of Certain Graphs Journal of Mathematics and System Science 6 (2016) 123-127 doi: 10.17265/2159-5291/2016.03.004 D DAVID PUBLISHING S. Sanal 1 and H. E. Vatsalya 2 1. Faculty of Mathematics, Ibri College of Technology,

More information

Group Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G.

Group Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G. Group Theory Jan 2012 #6 Prove that if G is a nonabelian group, then G/Z(G) is not cyclic. Aug 2011 #9 (Jan 2010 #5) Prove that any group of order p 2 is an abelian group. Jan 2012 #7 G is nonabelian nite

More information

U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018

U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze

More information

ON THE DETERMINATION OF A DEVELOPABLE TIMELIKE RULED SURFACE. Mustafa KAZAZ, Ali ÖZDEMİR, Tuba GÜROĞLU

ON THE DETERMINATION OF A DEVELOPABLE TIMELIKE RULED SURFACE. Mustafa KAZAZ, Ali ÖZDEMİR, Tuba GÜROĞLU SDÜ FEN EDEBİYAT FAKÜLTESİ FEN DERGİSİ (E-DERGİ). 008, (), 7-79 ON THE DETERMINATION OF A DEVELOPABLE TIMELIKE RULED SURFACE Mustafa KAZAZ, Ali ÖZDEMİR, Tuba GÜROĞLU Department of Mathematics, Faculty

More information

arxiv: v1 [math.ac] 28 Jun 2018

arxiv: v1 [math.ac] 28 Jun 2018 arxiv:1806.11442v1 [math.ac] 28 Jun 2018 On a new extension of the zero-divisor graph A. Cherrabi, H. Essannouni, E. Jabbouri,, A. Ouadfel Laboratory of Mathematics, Computing and Applications-Information

More information

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms 1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex

More information

arxiv: v2 [math.ac] 23 Feb 2011

arxiv: v2 [math.ac] 23 Feb 2011 arxiv:0808.3187v2 [math.ac] 23 Feb 2011 The Annihilating-Ideal Graph of Commutative Rings I M. Behboodi a,b and Z. Rakeei a a Department of Mathematical Science, Isfahan University of Technology, P. O.

More information

Diameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring

Diameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring International Mathematical Forum, Vol. 9, 2014, no. 29, 1369-1375 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47131 Diameter of the Zero Divisor Graph of Semiring of Matrices over

More information

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12 MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f

More information

1. Group Theory Permutations.

1. Group Theory Permutations. 1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7

More information

Automorphisms of strongly regular graphs and PDS in Abelian groups

Automorphisms of strongly regular graphs and PDS in Abelian groups Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke

More information

Section 19 Integral domains

Section 19 Integral domains Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There

More information

POWER SERIES SOLUTION OF DIFFERENTIAL ALGEBRAIC. Muhammet KURULAY and Mustafa BAYRAM 1

POWER SERIES SOLUTION OF DIFFERENTIAL ALGEBRAIC. Muhammet KURULAY and Mustafa BAYRAM 1 Dumlupmar Universitesi SaYI : 13 Haziran 007 Fen Bilirnleri Enstitusu Dergisi 130-3055 POWER SERIES SOLUTION OF DIFFERENTIAL ALGEBRAIC EQUATION Muhammet KURULAY and Mustafa BAYRAM 1 Yildiz Technical University,

More information

Combinatorial Commutative Algebra, Graph Colorability, and Algorithms

Combinatorial Commutative Algebra, Graph Colorability, and Algorithms I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline

More information

On the distance signless Laplacian spectral radius of graphs and digraphs

On the distance signless Laplacian spectral radius of graphs and digraphs Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then

More information

An Algorithmist s Toolkit September 15, Lecture 2

An Algorithmist s Toolkit September 15, Lecture 2 18.409 An Algorithmist s Toolkit September 15, 007 Lecture Lecturer: Jonathan Kelner Scribe: Mergen Nachin 009 1 Administrative Details Signup online for scribing. Review of Lecture 1 All of the following

More information

On Commutativity of Completely Prime Gamma-Rings

On Commutativity of Completely Prime Gamma-Rings alaysian Journal of athematical Sciences 7(2): 283-295 (2013) ALAYSIAN JOURNAL OF ATHEATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal 1,2 I. S. Rakhimov, 3* Kalyan Kumar Dey and 3 Akhil

More information

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,

More information

An other approach of the diameter of Γ(R) and Γ(R[X])

An other approach of the diameter of Γ(R) and Γ(R[X]) arxiv:1812.08212v1 [math.ac] 19 Dec 2018 An other approach of the diameter of Γ(R) and Γ(R[X]) A. Cherrabi, H. Essannouni, E. Jabbouri, A. Ouadfel Laboratory of Mathematics, Computing and Applications-Information

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else

18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else 18.312: Algebraic Combinatorics Lionel Levine Lecture date: Apr 14, 2011 Lecture 18 Notes by: Taoran Chen 1 Kasteleyn s theorem Theorem 1 (Kasteleyn) Let G be a finite induced subgraph of Z 2. Define the

More information

Journal of Science and Arts Year 17, No. 1(38), pp , 2017

Journal of Science and Arts Year 17, No. 1(38), pp , 2017 Journal of Science and Arts Year 17, No. 1(38), pp. 49-60, 2017 BOUNDS FOR THE ENERGY OF ( ) ORIGINAL PAPER ( ) USING 2-ADJACENCY SERIFE BUYUKKOSE 1, SEMIHA BASDAS NURKAHLI 1, NURSAH MUTLU 1 Manuscript

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND

More information

Algebra Exam Topics. Updated August 2017

Algebra Exam Topics. Updated August 2017 Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have

More information

Laplacians of Graphs, Spectra and Laplacian polynomials

Laplacians of Graphs, Spectra and Laplacian polynomials Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial

More information

Rings, Paths, and Paley Graphs

Rings, Paths, and Paley Graphs Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in

More information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

There are six more problems on the next two pages

There are six more problems on the next two pages Math 435 bg & bu: Topics in linear algebra Summer 25 Final exam Wed., 8/3/5. Justify all your work to receive full credit. Name:. Let A 3 2 5 Find a permutation matrix P, a lower triangular matrix L with

More information

The Fine Spectra of the Difference Operator Δ over the Sequence Spaces l 1 and bv

The Fine Spectra of the Difference Operator Δ over the Sequence Spaces l 1 and bv International Mathematical Forum, 1, 2006, no 24, 1153-1160 The Fine Spectra of the Difference Operator Δ over the Sequence Spaces l 1 and bv Kuddusi Kayaduman Gaziantep Üniversitesi Fen Edebiyat Fakültesi,Matematik

More information

Bipartite graphs with at most six non-zero eigenvalues

Bipartite graphs with at most six non-zero eigenvalues Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues

More information

RINGS HAVING ZERO-DIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH. S.B. Mulay

RINGS HAVING ZERO-DIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH. S.B. Mulay Bull. Austral. Math. Soc. Vol. 72 (2005) [481 490] 13a99, 05c99 RINGS HAVING ZERO-DIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH S.B. Mulay Let R be a commutative ring possessing (non-zero) zero-divisors.

More information

QUALIFYING EXAM IN ALGEBRA August 2011

QUALIFYING EXAM IN ALGEBRA August 2011 QUALIFYING EXAM IN ALGEBRA August 2011 1. There are 18 problems on the exam. Work and turn in 10 problems, in the following categories. I. Linear Algebra 1 problem II. Group Theory 3 problems III. Ring

More information

Very few Moore Graphs

Very few Moore Graphs Very few Moore Graphs Anurag Bishnoi June 7, 0 Abstract We prove here a well known result in graph theory, originally proved by Hoffman and Singleton, that any non-trivial Moore graph of diameter is regular

More information

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792 Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838

More information

AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS

AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:2 (2008), 53 57 AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR

More information

Communicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S

Communicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S Transactions on Combinatorics ISSN print: 2251-8657, ISSN on-line: 2251-8665 Vol. 01 No. 2 2012, pp. 49-57. c 2012 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON THE VALUES OF INDEPENDENCE

More information

Monotonluğu Koruyan Matrisler. Monotonicity Preserving Matrices

Monotonluğu Koruyan Matrisler. Monotonicity Preserving Matrices SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 2147-835X Degi sayfası: http://degipa.gov.t/saufenbilde Geliş/Received 15.02.2016 Kabul/Accepted 27.03.2017

More information

Lecture 3: graph theory

Lecture 3: graph theory CONTENTS 1 BASIC NOTIONS Lecture 3: graph theory Sonia Martínez October 15, 2014 Abstract The notion of graph is at the core of cooperative control. Essentially, it allows us to model the interaction topology

More information

On the energy of non-commuting graphs

On the energy of non-commuting graphs Journal of Linear Topological Algebra Vol 06 No 17 135-146 On the energy of non-commuting graphs M Ghorbani a Z Gharavi-Alkhansari a a Department of Mathematics Faculty of Science Shahid Rajaee Teacher

More information

On the Dynamic Chromatic Number of Graphs

On the Dynamic Chromatic Number of Graphs On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex

More information