TAILIEUCHUNG - On strongly regular graphs of order n = 7(2p+1) where 2p+1 is a prime number

In recent years, determining the parameter of strongly regular graph is a important problem of the theory graph. However, when the number of vertices of a strongly regular graph (called n) is any number, determining its parameter is very difficult and nobody can solve this problem. | JOURNAL OF SCIENCE OF HNUE Natural Sci. 2010 Vol. 55 No. 6 pp. 113-127 ON STRONGLY REGULAR GRAPHS OF ORDER n 7 2p 1 WHERE 2p 1 IS A PRIME NUMBER Vu Dinh Hoa Hanoi National University of Education Do Minh Tuan Nam Dinh Teacher Training College E-mail hoavd@ say that a regular graph G of order n and degree r 1 which is not the complete graph is strongly regular if there exists non-negative integers τ and θ such that Si Sj τ for any two adjacent vertices i and j and Si Sj θ for any two distinct non-adjacent vertices i and j where Sk denotes the neighbourhood of the vertex k. We describe here the parameters n r τ and θ for strongly regular graphs of order 7 2p 1 where 2p 1 is a prime number. Keywords Strongly regular graph conference graph integral graph. 1. Introduction . Some results of strongly regular graphs In recent years determining the parameter of strongly regular graph is a im- portant problem of the theory graph. However when the number of vertices of a strongly regular graph called n is any number determining its parameter is very difficult and nobody can solve this problem. Therefore we have some results in special cases of n Due to Theorem we have recently obtained the following result 2 i there is no strongly regular graph of order 4p 3 if 4p 3 is a prime number. ii the only strongly regular graph of order 4p 1 are conference graphs if 4p 1 is a prime number. Besides 2-5 we have decribed the parameters n r τ and θ for strongly regular graphs of order 2 2p 1 3 2p 1 4 2p 1 5 2p 1 and 6 2p 1 where 2p 1 is the prime number. In this article We now proceed to establish the parameters of strongly regular graphs of order 7 2p 1 where 2p 1 is a prime number as follows. In order to solve the problem. First we have some results about relations of the parameters of strongly regular graphs 113 Vu Dinh Hoa and Do Minh Tuan i A strongly regular graph G of order 4n 1 and degree r 2n with τ n 1 and θ n is called the conference graph. ii A .

• Toán học
• Natural science
• Strongly regular graph
• Conference graph
• Integral graph
• Regular graph G
• Integrated teaching
• Natural Science education
• Natural Science teaching
• Dạy học tích hợp
• Giáo dục khoa học tự nhiên
• Dạy học khoa học tự nhiên
• Journal of Science and Technology
• Synthesis of hydroxyl terminated liquid natural rubber
• Hydroxyl terminated liquid natural rubber
• Deproteinized natural rubber
• Oxidative depolymerization of NR
• Mathematics – physics
• Teaching competency framework
• General education program
• Natural science teachers
• High school education
• Natural science teachers
• NATURAL LANGUAGE
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• scientific reports
• model language
• process natural language
• Master's thesis of Applied Science
• Master's thesis
• Studies in marine natural products
• Marine natural products
• Nasal cavity anatomy
• Experimental studies in rhinology
• Geometric variations
• Cambridge primary science
• Natural Science book
• Science English activity book 1
• Exercise primary English
• Learn Science with English
• Science English learner book 1
• Primary Enlish book
• Science English activity book 2
• Science English learn book 2
• Khoa học tự nhiên tiểu học
• Science English activity book 3
• Science English learn book 3
• Science English activity book 5
• Science English activity book 6
• Environmental science
• Lecture Environmental science
• Natural system
• Environmental problems
• Natural world
• Sustainable future
• Sustainability in ecosystems
• Organic compounds
• Dynamic equilibrium
• The human population
• Saltwater intrusion
• Soil horizons
• Production of food