2022
DOI: 10.3390/e24030387
|View full text |Cite
|
Sign up to set email alerts
|

The Generalized Euler Characteristics of the Graphs Split at Vertices

Abstract: We show that there is a relationship between the generalized Euler characteristic Eo(|VDo|) of the original graph that was split at vertices into two disconnected subgraphs i=1,2 and their generalized Euler characteristics Ei(|VDi|). Here, |VDo| and |VDi| denote the numbers of vertices with the Dirichlet boundary conditions in the graphs. The theoretical results are experimentally verified using microwave networks that simulate quantum graphs. We demonstrate that the evaluation of the generalized Euler charact… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 68 publications
0
3
0
Order By: Relevance
“…In this article we consider a general situation when an original graph . Simpler situations of quantum graphs split only at vertices or at edges were considered in [66,67] and [68], respectively.…”
Section: A Graph Split At Edges and Vertices Into Two Subgraphsmentioning
confidence: 99%
“…In this article we consider a general situation when an original graph . Simpler situations of quantum graphs split only at vertices or at edges were considered in [66,67] and [68], respectively.…”
Section: A Graph Split At Edges and Vertices Into Two Subgraphsmentioning
confidence: 99%
“…The last in-presentation-order (QU) paper of the SI “The Generalized Euler Characteristics of the Graphs Split at Vertices” [ 10 ] argues that there is a relationship between the generalized Euler characteristic of an original graph that was split at vertices into two disconnected subgraphs, and their generalized Euler characteristics. The theoretical results are experimentally justified by employing microwave networks that mimic quantum graphs.…”
mentioning
confidence: 99%
“…To summarize, this SI has focused on relevant and fundamental issues of statistical classical/quantum physics (and related subdisciplines), pointing to maximum-entropy and entropy production (and/or the spread of information) principles experienced by the respective CL and QU systems in (non)equilibrium conditions. The studies [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 ] disclose both the theoretical depth as well as the practical usefulness of the applied CL and QU approaches.…”
mentioning
confidence: 99%