Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2411.12599 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929597869719552 |
|---|---|
| author | Ashokan, Anjitha A V, Chithra |
| author_facet | Ashokan, Anjitha A V, Chithra |
| contents | The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the $ε$-spectrum, $ε$-energy, $ε$-inertia and irreducibility of the central graph (respectively complement of the central graph) of a triangle-free regular graph(respectively regular graph). Also look into the $ε-$spectrum and the irreducibility of different central graph operations, such as central vertex join, central edge join, and central vertex-edge join. We also examine the $ε-$ energy of some specific graphs. These findings allow us to construct new families of $ε$-cospectral graphs and non $ε$-cospectral $ε-$equienergetic graphs. Additionally, we investigate certain upper and lower bounds for the eccentricity Wiener index of graphs. Also, provide an upper bound for the eccentricity energy of a self-centered graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_12599 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Eccentricity spectrum of join of central graphs and Eccentricity Wiener index of graphs Ashokan, Anjitha A V, Chithra Combinatorics The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the $ε$-spectrum, $ε$-energy, $ε$-inertia and irreducibility of the central graph (respectively complement of the central graph) of a triangle-free regular graph(respectively regular graph). Also look into the $ε-$spectrum and the irreducibility of different central graph operations, such as central vertex join, central edge join, and central vertex-edge join. We also examine the $ε-$ energy of some specific graphs. These findings allow us to construct new families of $ε$-cospectral graphs and non $ε$-cospectral $ε-$equienergetic graphs. Additionally, we investigate certain upper and lower bounds for the eccentricity Wiener index of graphs. Also, provide an upper bound for the eccentricity energy of a self-centered graph. |
| title | Eccentricity spectrum of join of central graphs and Eccentricity Wiener index of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.12599 |