Academic Journal

Quadratic embedding constants of lexicographic product graphs.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Quadratic embedding constants of lexicographic product graphs.
Συγγραφείς: Mou, Guiqiang1 (AUTHOR) guiqiang.mou@csu.edu.cn
Πηγή: Linear Algebra & its Applications. Oct2026, Vol. 746, p1-17. 17p.
Θεματικοί όροι: *Complete graphs, *Regular graphs, *Matrices (Mathematics), *Bipartite graphs, *Graph theory, *Quadratic forms
Περίληψη: The quadratic embedding constant of a finite and connected graph G , denoted by QEC(G), is defined as the maximum of the quadratic form of the distance matrix of G on the subset of the unit sphere orthogonal to the all-ones vector. In this paper, we study the QEC of lexicographic product graphs, and establish general formulas for QEC (G [ H ]) when one factor is a complete graph or a complete bipartite graph. In particular, when the other factor is a regular graph, we derive explicit formulas for QEC (G [ H ]). [ABSTRACT FROM AUTHOR]
Βάση Δεδομένων: Academic Search Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.doi.org/10.1016/j.laa.2026.05.012?
    Name: ScienceDirect (all content) (s7799221)
    Category: fullText
    Text: View record from ScienceDirect
    MouseOverText: View record from ScienceDirect
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:asx&genre=article&issn=00243795&ISBN=&volume=746&issue=&date=20261001&spage=1&pages=1-17&title=Linear Algebra & its Applications&atitle=Quadratic%20embedding%20constants%20of%20lexicographic%20product%20graphs.&aulast=Mou%2C%20Guiqiang&id=DOI:10.1016/j.laa.2026.05.012
    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: 194426523
RelevancyScore: 1452
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1452.43029785156
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Quadratic embedding constants of lexicographic product graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mou%2C+Guiqiang%22">Mou, Guiqiang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> guiqiang.mou@csu.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Linear+Algebra+%26+its+Applications%22">Linear Algebra & its Applications</searchLink>. Oct2026, Vol. 746, p1-17. 17p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Complete+graphs%22">Complete graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Matrices+%28Mathematics%29%22">Matrices (Mathematics)</searchLink><br />*<searchLink fieldCode="DE" term="%22Bipartite+graphs%22">Bipartite graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br />*<searchLink fieldCode="DE" term="%22Quadratic+forms%22">Quadratic forms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The quadratic embedding constant of a finite and connected graph G , denoted by QEC(G), is defined as the maximum of the quadratic form of the distance matrix of G on the subset of the unit sphere orthogonal to the all-ones vector. In this paper, we study the QEC of lexicographic product graphs, and establish general formulas for QEC (G [ H ]) when one factor is a complete graph or a complete bipartite graph. In particular, when the other factor is a regular graph, we derive explicit formulas for QEC (G [ H ]). [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=194426523
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.laa.2026.05.012
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 1
    Subjects:
      – SubjectFull: Complete graphs
        Type: general
      – SubjectFull: Regular graphs
        Type: general
      – SubjectFull: Matrices (Mathematics)
        Type: general
      – SubjectFull: Bipartite graphs
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Quadratic forms
        Type: general
    Titles:
      – TitleFull: Quadratic embedding constants of lexicographic product graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mou, Guiqiang
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 00243795
          Numbering:
            – Type: volume
              Value: 746
          Titles:
            – TitleFull: Linear Algebra & its Applications
              Type: main
ResultId 1