Digital Repository of Luhansk Taras Shevchenko National University

Browsing Algebra and Discrete Mathematics. - № 2 (26). - 2018 by Title

Browsing Algebra and Discrete Mathematics. - № 2 (26). - 2018 by Title

Sort by: Order: Results:

  • Das, P.K.; Singh, K.R. (ДЗ "ЛНУ імені Тараса Шевченка", 2018)
    Abstract . A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G ∼= Ω(H, ψ). Then the graph G is said to be self-graphoidal if it is isomorphic to one of its graphoidal ...
  • Dudenko, M.; liynyk, B.O. (ДЗ"ЛНУ імені Тараса Шевченко", 2018)
    We show that if G is a unicyclic graph with metric dimension 2 and {a, b} is a metric basis of G then the degree of any vertex v of G is at most 4 and degrees of both a and b are at most 2. The constructions of unispider ...
  • Kochubinska, E. (ДЗ "ЛНУ імені Тараса Шевченка", 2018)
    We study asymptotics of the spectral measure of a randomly chosen partial automorphism of a rooted tree. To every partial automorphism x we assign its action matrix Ax. It is shown that the uniform distribution on eigenvalues ...

Search DSpace


Advanced Search

Browse

My Account