Academic Journal
Προβολή σε EDS

VERTEX-TRANSITIVE NEUMAIER GRAPHS.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: VERTEX-TRANSITIVE NEUMAIER GRAPHS.
Συγγραφείς: JAZAERI, MOJTABA1 m.jazaeri@scu.ac.ir
Πηγή: Transactions on Combinatorics. Sep2026, Vol. 15 Issue 3, p203-214. 12p.
Θεματικοί όροι: *Regular graphs, *Cayley graphs, *Graph theory
Περίληψη: A graph G is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique C in G is called regular whenever for any vertex out of C, the number of its neighbors in C is independent of the vertex. A Neumaier graph is a non-complete edge-regular graph with a regular clique. In this paper, we study vertex-transitive Neumaier graphs. We give a necessary and sufficient condition under which a vertex-transitive Neumaier graph is strongly regular. We also identify Neumaier Cayley graphs with small valency at most 10 among vertex-transitive Neumaier graphs. [ABSTRACT FROM AUTHOR]
Βάση Δεδομένων: Academic Search Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:asx&genre=article&issn=22518657&ISBN=&volume=15&issue=3&date=20260901&spage=203&pages=203-214&title=Transactions on Combinatorics&atitle=VERTEX-TRANSITIVE%20NEUMAIER%20GRAPHS.&aulast=JAZAERI%2C%20MOJTABA&id=DOI:10.22108/toc.2025.144052.2240
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: asx
DbLabel: Academic Search Index
An: 191908156
RelevancyScore: 1452
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1452.42749023438
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: VERTEX-TRANSITIVE NEUMAIER GRAPHS.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22JAZAERI%2C+MOJTABA%22">JAZAERI, MOJTABA</searchLink><relatesTo>1</relatesTo><i> m.jazaeri@scu.ac.ir</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Transactions+on+Combinatorics%22">Transactions on Combinatorics</searchLink>. Sep2026, Vol. 15 Issue 3, p203-214. 12p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Cayley+graphs%22">Cayley graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A graph G is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique C in G is called regular whenever for any vertex out of C, the number of its neighbors in C is independent of the vertex. A Neumaier graph is a non-complete edge-regular graph with a regular clique. In this paper, we study vertex-transitive Neumaier graphs. We give a necessary and sufficient condition under which a vertex-transitive Neumaier graph is strongly regular. We also identify Neumaier Cayley graphs with small valency at most 10 among vertex-transitive Neumaier graphs. [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=191908156
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.22108/toc.2025.144052.2240
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 203
    Subjects:
      – SubjectFull: Regular graphs
        Type: general
      – SubjectFull: Cayley graphs
        Type: general
      – SubjectFull: Graph theory
        Type: general
    Titles:
      – TitleFull: VERTEX-TRANSITIVE NEUMAIER GRAPHS.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: JAZAERI, MOJTABA
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 22518657
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Transactions on Combinatorics
              Type: main
ResultId 1