Loading [MathJax]/jax/output/CommonHTML/jax.js
Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Zametki, 2013, Volume 93, Issue 4, Pages 492–508
DOI: https://doi.org/10.4213/mzm10172
(Mi mzm10172)
 

This article is cited in 2 scientific papers (total in 2 papers)

Classification of Seven-Point Four-Distance Sets in the Plane

Wenhua Lana, Xiang Lin Weib

a Hebei Normal University
b Hebei University of Science and Technology
Full-text PDF (574 kB) Citations (2)
References:
Abstract: A point set X in the plane is called a k-distance set if there are exactly k different distances between two distinct points in X. In this paper, we classify 7-point 4-distance sets and show that there are forty two 7-point 4-distance sets in the plane up to isomorphism, we also give some results about diameter graphs.
Keywords: n-point k-distance set, isomorphism, diameter graph.
Received: 04.03.2011
Revised: 30.08.2012
English version:
Mathematical Notes, 2013, Volume 93, Issue 4, Pages 510–522
DOI: https://doi.org/10.1134/S000143461303019X
Bibliographic databases:
Document Type: Article
UDC: 517.956
Language: Russian
Citation: Wenhua Lan, Xiang Lin Wei, “Classification of Seven-Point Four-Distance Sets in the Plane”, Mat. Zametki, 93:4 (2013), 492–508; Math. Notes, 93:4 (2013), 510–522
Citation in format AMSBIB
\Bibitem{WenWei13}
\by Wenhua Lan, Xiang~Lin~Wei
\paper Classification of Seven-Point Four-Distance Sets in the Plane
\jour Mat. Zametki
\yr 2013
\vol 93
\issue 4
\pages 492--508
\mathnet{http://mi.mathnet.ru/mzm10172}
\crossref{https://doi.org/10.4213/mzm10172}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3205998}
\zmath{https://zbmath.org/?q=an:06185227}
\elib{https://elibrary.ru/item.asp?id=20731707}
\transl
\jour Math. Notes
\yr 2013
\vol 93
\issue 4
\pages 510--522
\crossref{https://doi.org/10.1134/S000143461303019X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000317986600019}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84876426868}
Linking options:
  • https://www.mathnet.ru/eng/mzm10172
  • https://doi.org/10.4213/mzm10172
  • https://www.mathnet.ru/eng/mzm/v93/i4/p492
  • This publication is cited in the following 2 articles:
    1. Ferenc Szöllősi, Lecture Notes in Computer Science, 13034, Discrete and Computational Geometry, Graphs, and Games, 2021, 18  crossref
    2. Wei Xianglin, Li Guogang, Cong Yue, Gao Feixing, “Distance sets with diameter graph being cycle”, Taiwanese J. Math., 18:6 (2014), 1981–1990  crossref  mathscinet  zmath  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:404
    Full-text PDF :172
    References:48
    First page:10
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025