On Maximal Distance Energy
Let <i>G</i> be a graph of order <i>n</i>. If the maximal connected subgraph of <i>G</i> has no cut vertex then it is called a block. If each block of graph <i>G</i> is a clique then <i>G</i> is called clique tree. The distance energy <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"...
Bewaard in:
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI AG
2021-02-01
|
| Reeks: | Mathematics |
| Onderwerpen: | |
| Online toegang: | https://www.mdpi.com/2227-7390/9/4/360 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|