Aug 2026· International Journal of Mathematics Trends and Technology· Vol 72, pp. 14-24· 0 citations· 10 references
Abstract
Let 𝐺 be a 𝑘-regular graph on 𝑛 vertices. In this paper, we determine the maximum and minimum degree energies of two specific graph operations: the extended 𝑚-splitting graph. 𝑆𝑝𝑙𝑚∗ (𝐺) and the 𝑚-semi shadow graph 𝑆𝐷𝑚(𝐺). By applying block matrix decompositions and unitary similarity transformations, we express the maximum and minimum degree spectra of these constructs explicitly in terms of the ordinary adjacency spectrum of the base graph 𝐺. Furthermore, we derive exact, closed-form expressions for their respective maximum and minimum degree energies. As applications of our main theorems, the corresponding energies for well-known families of regular graphs—including cycle, complete, and complete bipartite graphs—are explicitly established.
For a graph and a graph family , let denote the maximum number of copies of in an ‐free ‐vertex graph. Let . Bai, Tompkins, and Well conjectured that is attained if and each block of the graph is a . In this paper, we determine the exact value of and the extremal graphs for all . The novelty of our proof is to give a...
Xiaojun Zhao, Yuejian Peng· Journal of Graph Theory· 2 citations
Graph energy is an important concept in spectral graph theory with applications in mathematics and chemistry. In this paper, we study the Laplacian minimum domination energy of derived graphs of some standard graphs. The main aim is to obtain formulas, properties, and bounds for this energy measure. The study considers...
Jagadeesh Rajanna, Ashwini Ankanahalli Shashidhara· American Journal of Applied...· 0 citations
Let $s^+(G)$ denote the sum of the squares of the positive adjacency eigenvalues of a graph $G$. The square-energy conjecture of Elphick, Farber, Goldberg, and Wocjan, proved by Liu, Tang, and Zhang, gives a lower bound of $n-1$ for any connected graph of order $n$. We strengthen this bound to $s^+(G)\ge n$ for every c...
This work establishes general properties of k -total bondage and finds exact values for certain graph classes including paths, cycles, wheels, complete and complete bipartite graphs.
For a given geometric graph-convexity on a graph $G$ equipped with a weight function on the vertices with value in $\mathbb{Z}$, the Max Weight Convex Set problem consists in determining the convex set $S$ with maximum weight (sum of the weight of the vertices in $S$). Although the problem is NP-complete in general, it...
Fariza Aklouche, Pierre Bergé, M. Habib· 0 citations
Maxwell observed that the graph of any rigid generic framework in $\mathbb{R}^d$ on $n$ vertices has at least $dn-\binom{d+1}{2}$ edges. In this article we prove that graphs whose complement has maximum degree at most two and no component isomorphic to a triangle or a square are rigid in the maximum dimension allowed b...
John Haslegrave, Peleg Michaeli, Anthony Nixon· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
