Academic Journal
View in EDS

On the resistance regular graphs.

Bibliographic Details
Title: On the resistance regular graphs.
Authors: Haritha, T.1 (AUTHOR) harithathottungal96@gmail.com, Chithra, A. V.1 (AUTHOR) chithra@nitc.ac.in
Source: Discrete Mathematics, Algorithms & Applications. Oct2026, p1. 20p.
Subject Terms: *Regular graphs, *Spectral theory, *Mathematical bounds
Abstract: For a simple connected graph G, its resistance distance matrix is denoted by R(G). A graph G is called resistance regular if all the row (or column) sums of R(G) are equal. We provide a necessary and sufficient condition for a simple connected graph to be resistance regular. Additionally, we establish sharp bounds for the resistance spectral radius and present various bounds for the resistance energy of G. Furthermore, we compute the resistance spectrum and resistance energy of some resistance regular graphs. [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
FullText Text:
  Availability: 0
Header DbId: asx
DbLabel: Academic Search Index
An: 197580278
RelevancyScore: 1452
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1452.43041992188
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the resistance regular graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Haritha%2C+T%2E%22">Haritha, T.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> harithathottungal96@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Chithra%2C+A%2E+V%2E%22">Chithra, A. V.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> chithra@nitc.ac.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics%2C+Algorithms+%26+Applications%22">Discrete Mathematics, Algorithms & Applications</searchLink>. Oct2026, p1. 20p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Spectral+theory%22">Spectral theory</searchLink><br />*<searchLink fieldCode="DE" term="%22Mathematical+bounds%22">Mathematical bounds</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: For a simple connected graph G, its resistance distance matrix is denoted by R(G). A graph G is called resistance regular if all the row (or column) sums of R(G) are equal. We provide a necessary and sufficient condition for a simple connected graph to be resistance regular. Additionally, we establish sharp bounds for the resistance spectral radius and present various bounds for the resistance energy of G. Furthermore, we compute the resistance spectrum and resistance energy of some resistance regular graphs. [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=197580278
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/s1793830926500904
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 1
    Subjects:
      – SubjectFull: Regular graphs
        Type: general
      – SubjectFull: Spectral theory
        Type: general
      – SubjectFull: Mathematical bounds
        Type: general
    Titles:
      – TitleFull: On the resistance regular graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Haritha, T.
      – PersonEntity:
          Name:
            NameFull: Chithra, A. V.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 05
              M: 10
              Text: Oct2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 17938309
          Titles:
            – TitleFull: Discrete Mathematics, Algorithms & Applications
              Type: main
ResultId 1