A generalization of Moore graphs of diameter two

Article Properties
Cite
Bose, R.C, and T.A Dowling. “A Generalization of Moore Graphs of Diameter Two”. Journal of Combinatorial Theory, Series B, vol. 11, no. 3, 1971, pp. 213-26, https://doi.org/10.1016/0095-8956(71)90031-1.
Bose, R., & Dowling, T. (1971). A generalization of Moore graphs of diameter two. Journal of Combinatorial Theory, Series B, 11(3), 213-226. https://doi.org/10.1016/0095-8956(71)90031-1
Bose, R.C, and T.A Dowling. “A Generalization of Moore Graphs of Diameter Two”. Journal of Combinatorial Theory, Series B 11, no. 3 (1971): 213-26. https://doi.org/10.1016/0095-8956(71)90031-1.
Bose R, Dowling T. A generalization of Moore graphs of diameter two. Journal of Combinatorial Theory, Series B. 1971;11(3):213-26.
Journal Category
Science
Mathematics
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Strongly regular graphs, partial geometries and partially balanced designs Pacific Journal of Mathematics
  • Science: Mathematics
 254 1963
On Moore Graphs with Diameters 2 and 3 IBM Journal of Research and Development
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 251 1960
On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs The Annals of Mathematical Statistics 108 1959
Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes Journal of the American Statistical Association
  • Science: Mathematics: Probabilities. Mathematical statistics
  • Science: Mathematics
 120 1952
Graphs in which each pair of vertices is adjacent to the same number d of other vertices Studia Scientiarum Mathematicarum Hungarica
  • Science: Mathematics
 1970
Refrences Analysis
Category Category Repetition
Science: Mathematics3
The category Science: Mathematics 3 is the most frequently represented among the references in this article. It primarily includes studies from Studia Scientiarum Mathematicarum Hungarica and Pacific Journal of Mathematics. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
On the spectrum and linear programming bound for hypergraphs European Journal of Combinatorics
  • Science: Mathematics
 1 2022
Automorphisms of a Graph With Intersection Array {nm − 1, nm− n + m − 1, n − m + 1;1, 1, nm− n + m − 1} Algebra and Logic
  • Science: Mathematics
  • Science: Mathematics
 2020
Inverse Problems in Graph Theory: Nets Communications in Mathematics and Statistics
  • Science: Mathematics
 5 2018
On Terwilliger graphs with µ = 4 Proceedings of the Steklov Institute of Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2009
Terwilliger graphs with μ ≤ 3 Mathematical Notes
  • Science: Mathematics
 2007
Citations Analysis
Category Category Repetition
Science: Mathematics18
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods3
Technology: Engineering (General). Civil engineering (General)2
The category Science: Mathematics 18 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On finite moore geometries and was published in 1977. The most recent citation comes from a 2022 study titled On the spectrum and linear programming bound for hypergraphs. This article reached its peak citation in 2007, with 2 citations. It has been cited in 12 different journals. Among related journals, the Discrete Mathematics cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year