О графах без корон с регулярными $\mu$-подграфами, II

Article Properties
  • Language
    Russian
  • DOI (url)
    10.4213/mzm273
  • Publication Date
    2003/01/01
  • Journal
    Matematicheskie Zametki
  • Indian UGC (journal)
  • Refrences
    6
  • Citations
    7
  • Владислав Владимирович Кабанов
  • Vladislav Vladimirovich Kabanov
  • Александр Алексеевич Махнев
  • Aleksandr Alekseevich Makhnev
  • Дмитрий Викторович Падучих
  • Dmitrii Viktorovich Paduchikh
Cite
Кабанов, Владислав Владимирович, et al. “О графах без корон с регулярными $\mu$-подграфами, II”. Matematicheskie Zametki, vol. 74, no. 3, 2003, pp. 396-0, https://doi.org/10.4213/mzm273.
Кабанов, В. В., Kabanov, V. V., Махнев, А. А., Makhnev, A. A., Падучих, Д. В., & Paduchikh, D. V. (2003). О графах без корон с регулярными $\mu$-подграфами, II. Matematicheskie Zametki, 74(3), 396-406. https://doi.org/10.4213/mzm273
Кабанов ВВ, Kabanov VV, Махнев АА, Makhnev AA, Падучих ДВ, Paduchikh DV. О графах без корон с регулярными $\mu$-подграфами, II. Matematicheskie Zametki. 2003;74(3):396-40.
Refrences
Title Journal Journal Categories Citations Publication Date
О графах без корон с регулярными $\mu$-подграфами Matematicheskie Zametki 3 2000
Об одном классе графов без 3-лап Matematicheskie Zametki 4 1998
Графы без 3-лап с равномощными $\mu$-подграфами 1998
10.1007/978-3-642-74341-2 1989
Designs, Graphs, Codes and their Links 1981
Citations
Title Journal Journal Categories Citations Publication Date
On graphs in which the intersection of neighborhoods of vertices from every 3-coclique is a clique Doklady Mathematics
  • Science: Mathematics
 2011
Amply regular graphs with Hoffman’s condition Proceedings of the Steklov Institute of Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2009
A characterization of one class of graphs without 3-claws Proceedings of the Steklov Institute of Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2009
Strongly regular graphs with Hoffman’s condition Proceedings of the Steklov Institute of Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2008
Terwilliger graphs with μ ≤ 3 Mathematical Notes
  • Science: Mathematics
 2007
Citations Analysis
Category Category Repetition
Science: Mathematics6
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods3
The category Science: Mathematics 6 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Графы Тервиллигера с $\mule3$ and was published in 2007. The most recent citation comes from a 2011 study titled On graphs in which the intersection of neighborhoods of vertices from every 3-coclique is a clique. This article reached its peak citation in 2007, with 3 citations. It has been cited in 4 different journals. Among related journals, the Proceedings of the Steklov Institute of Mathematics cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year