Skip to main navigation Skip to search Skip to main content

On the independence number of distance graphs with vertices in {-1, 0, 1}n

  • Lomonosov Moscow State University

Research output: Contribution to journalArticlepeer-review

5 Scopus citations
Original languageEnglish
Pages (from-to)744-746
Number of pages3
JournalMathematical Notes
Volume86
Issue number5-6
DOIs
StatePublished - 2009
Externally publishedYes

Bibliographical note

Funding Information:
This work was supported by the Russian Foundation for Basic Research (grant no. 06-01-00383), the program for support of young doctors of sciences (grant no. MD-5414.2008.1), the program “Leading Scientific Schools” (grant no. NSh-691.2008.1), and the foundation “Dynasty.”

Funding

This work was supported by the Russian Foundation for Basic Research (grant no. 06-01-00383), the program for support of young doctors of sciences (grant no. MD-5414.2008.1), the program “Leading Scientific Schools” (grant no. NSh-691.2008.1), and the foundation “Dynasty.”

FundersFunder number
Leading Scientific SchoolsNSh-691.2008.1
Russian Foundation for Basic Research06-01-00383, MD-5414.2008.1

    Keywords

    • Degree of a vertex
    • Distance graph
    • Incidence matrix
    • Independence number

    Cite this