Loading [MathJax]/jax/output/SVG/config.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, 2006, Volume 80, Issue 4, Pages 627–629
DOI: https://doi.org/10.4213/mzm2855 (Mi mzm2855) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On weakly cospectral graphs

S. P. Strunkov

State University – Higher School of Economics
Full-text PDF (318 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm2855
Abstract: We prove that any set of pair-wise nonisomorphic strongly connected weakly cospectral pseudodigraphs whose set of nilpotency indices is finite also is finite.
Received: 29.11.2005
English version:
Mathematical Notes, 2006, Volume 80, Issue 4, Pages 590–592
DOI: https://doi.org/10.1007/s11006-006-0178-4
Bibliographic databases:
UDC: 519.1
Language: Russian
Citation: S. P. Strunkov, “On weakly cospectral graphs”, Mat. Zametki, 80:4 (2006), 627–629; Math. Notes, 80:4 (2006), 590–592
Citation in format AMSBIB
\Bibitem{Str06}
\by S.~P.~Strunkov
\paper On weakly cospectral graphs
\jour Mat. Zametki
\yr 2006
\vol 80
\issue 4
\pages 627--629
\mathnet{http://mi.mathnet.ru/mzm2855}
\crossref{https://doi.org/10.4213/mzm2855}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2316164}
\zmath{https://zbmath.org/?q=an:1110.05065}
\elib{https://elibrary.ru/item.asp?id=9293168}
\transl
\jour Math. Notes
\yr 2006
\vol 80
\issue 4
\pages 590--592
\crossref{https://doi.org/10.1007/s11006-006-0178-4}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000241868700037}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33750286468}
Linking options:
  • https://www.mathnet.ru/eng/mzm2855
  • https://doi.org/10.4213/mzm2855
  • https://www.mathnet.ru/eng/mzm/v80/i4/p627
    Cycle of papers
    This publication is cited in the following 1 articles:
    1. Satu Elisa Schaeffer, “Graph clustering”, Computer Science Review, 1:1 (2007), 27  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:509
    Full-text PDF :215
    References:91
    First page:8
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025