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 <i...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/4/360 |