2017
DOI: 10.3390/sym10010001
|View full text |Cite
|
Sign up to set email alerts
|

A Hierarchical Structure for the Sharp Constants of Discrete Sobolev Inequalities on a Weighted Complete Graph

Abstract: This paper clarifies the hierarchical structure of the sharp constants for the discrete Sobolev inequality on a weighted complete graph. To this end, we introduce a generalized-graph Laplacian A = I − B on the graph, and investigate two types of discrete Sobolev inequalities. The sharp constants C 0 (N; a) and C 0 (N) were calculated through the Green matrix G(a) = (A + aI) −1 (0 < a < ∞) and the pseudo-Green matrix G * = A † . The sharp constants are expressed in terms of the expansion coefficients of the cha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Certain special types of connected graphs are also interesting to study and look for some applications, especially a complete graph which is a graph in which every two distinct vertices are adjacent. Some authors considered a complete graph for applying its structure to complete their research, see for examples [4,5]. Furthermore, an algebraic formation on connected graphs has been studied in the sense of defining some binary operations among a pair of such graphs.…”
Section: Introductionmentioning
confidence: 99%
“…Certain special types of connected graphs are also interesting to study and look for some applications, especially a complete graph which is a graph in which every two distinct vertices are adjacent. Some authors considered a complete graph for applying its structure to complete their research, see for examples [4,5]. Furthermore, an algebraic formation on connected graphs has been studied in the sense of defining some binary operations among a pair of such graphs.…”
Section: Introductionmentioning
confidence: 99%