Ural Mathematical Journal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Ural Math. J.:
Year:
Volume:
Issue:
Page:
Find






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


Ural Mathematical Journal, 2021, Volume 7, Issue 1, Pages 102–108
DOI: https://doi.org/10.15826/umj.2021.1.009
(Mi umj141)
 

The vertex distance complement spectrum of subdivision vertex join and subdivision edge join of two regular graphs

Ann Susa Thomasa, Sunny Joseph Kalayathankalb, Joseph Varghese Kureetharac

a Department of Mathematics, St Thomas College
b Jyothi Engineering College
c Department of Mathematics, Christ University
References:
Abstract: The vertex distance complement (VDC) matrix $C$, of a connected graph $G$ with vertex set consisting of $n$ vertices, is a real symmetric matrix $[c_{ij}]$ that takes the value $n - d_{ij}$ where $d_{ij}$ is the distance between the vertices $v_i$ and $v_j$ of $G$ for $i \neq j$ and 0 otherwise. The vertex distance complement spectrum of the subdivision vertex join, $G_1 \dot{\bigvee} G_2$ and the subdivision edge join $G_1 \underline{\bigvee} G_2$ of regular graphs $G_1$ and $G_2$ in terms of the adjacency spectrum are determined in this paper.
Keywords: distance matrix, vertex distance complement spectrum, subdivision vertex join, subdivision edge join.
Bibliographic databases:
Document Type: Article
Language: English
Citation: Ann Susa Thomas, Sunny Joseph Kalayathankal, Joseph Varghese Kureethara, “The vertex distance complement spectrum of subdivision vertex join and subdivision edge join of two regular graphs”, Ural Math. J., 7:1 (2021), 102–108
Citation in format AMSBIB
\Bibitem{ThoKalKur21}
\by Ann~Susa~Thomas, Sunny~Joseph~Kalayathankal, Joseph~Varghese~Kureethara
\paper The vertex distance complement spectrum of subdivision vertex join and subdivision edge join of two regular graphs
\jour Ural Math. J.
\yr 2021
\vol 7
\issue 1
\pages 102--108
\mathnet{http://mi.mathnet.ru/umj141}
\crossref{https://doi.org/10.15826/umj.2021.1.009}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=MR4301217}
\zmath{https://zbmath.org/?q=an:1473.05079}
\elib{https://elibrary.ru/item.asp?id=46381218}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85111959298}
Linking options:
  • https://www.mathnet.ru/eng/umj141
  • https://www.mathnet.ru/eng/umj/v7/i1/p102
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Ural Mathematical Journal
    Statistics & downloads:
    Abstract page:99
    Full-text PDF :48
    References:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024