Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. Saratov Univ. Math. Mech. Inform.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2013, Volume 13, Issue 2(1), Pages 105–111
DOI: https://doi.org/10.18500/1816-9791-2013-13-2-1-105-111 (Mi isu403) 		 
Computer science

On upper bound of vertex distinguishing word length on vertex labeled graph

S. V. Sapunov

Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Ukraine, 83114, Donetsk, R. Luxemburg st., 74
Full-text PDF (528 kB)
References:
PDF
HTML
DOI: https://doi.org/10.18500/1816-9791-2013-13-2-1-105-111
Abstract: The problem of vertex distinguishing on vertex labeled graphs is considered. Two vertices are called distinguishable if associated languages over the alphabet of labels are different. A linear upper bound of vertex distinguishing word length equal to half the number of vertices is obtained.
Key words: vertex labeled graphs, languages over the label alphabet, vertex equivalence.
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: S. V. Sapunov, “On upper bound of vertex distinguishing word length on vertex labeled graph”, Izv. Saratov Univ. Math. Mech. Inform., 13:2(1) (2013), 105–111
Citation in format AMSBIB
\Bibitem{Sap13}
\by S.~V.~Sapunov
\paper On upper bound of vertex distinguishing word length on vertex labeled graph
\jour Izv. Saratov Univ. Math. Mech. Inform.
\yr 2013
\vol 13
\issue 2(1)
\pages 105--111
\mathnet{http://mi.mathnet.ru/isu403}
\crossref{https://doi.org/10.18500/1816-9791-2013-13-2-1-105-111}
\elib{https://elibrary.ru/item.asp?id=21813643}
Linking options:
  • https://www.mathnet.ru/eng/isu403
  • https://www.mathnet.ru/eng/isu/v13/i3/p105
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024