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 |
καταχωρήστε σχόλιο πρώτοι!