Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.12599

Eccentricity spectrum of join of central graphs and Eccentricity Wiener index of graphs

Anjitha Ashokan·Chithra A V
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anjitha Ashokan, Chithra A V. 2024-11-19. Eccentricity spectrum of join of central graphs and Eccentricity Wiener index of graphs. https://arxiv.org/abs/2411.12599

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗