SearcharxivSearch

arXiv subjects

G. Sivanesan

Publications and source records attributed to G. Sivanesan.

5 recordsLinked to original sources

Splitting fields and spectral invariants of character degree graphs in solvable groups

In this paper, we investigate the eigenvalues of character degree graphs, with particular emphasis on the arithmetic properties of their spectra. First, we study \((n-2)\)-regular character degree graphs of solvable groups and derive an explicit formula for their characteristic polynomials. We show that all their eigenvalues are rational and, consequently, that their splitting field is \(\mathbb{Q}\). We then consider supergraphs obtained by adding edges to these graphs and prove that the corresponding splitting field is a quadratic extension of \(\mathbb{Q}\). Next, using their structural decomposition, we examine a general class of Lewis graphs. For this class, we establish bounds on both the number of irrational eigenvalues and the degree of the associated splitting fields. Finally, we investigate prime character degree graphs of diameter \(3\), focusing on the arithmetic nature of their eigenvalues and the degree of their splitting fields.

math.CO

On prime character degree graphs occurring within a family of graphs (iii)

We conclude the classification work done in the two previous papers of the same name. Here we add flexibility to the construction, thereby viewing the graphs in full generality. Our goal, as ever, is to determine which graphs do or do not occur as the prime character degree graph of a solvable group.

math.GR

On the metric dimension of the character degree graph of a solvable group

Let $G$ be a finite solvable group and let $Δ(G)$ be the character degree graph of $G$. In this paper, we obtain the metric dimension of certain character degree graphs. Specifically, we calculate the metric dimension for a regular character degree graph, a character degree graph with a diameter of $2$ that is not a block, a character degree graph with a diameter of $3$ that also has a cut vertex and a character degree graph with Fitting height $2.$ We also consider two related parameters, base size and adjacency dimension, and their relation to metric dimension for character degree graphs of solvable groups.

math.GR

Laplacian Eigen values of character degree graphs of solvable groups

Let $G$ be a finite solvable group, let $Irr(G)$ be the set of all complex irreducible characters of $G$ and let $cd(G)$ be the set of all degrees of characters in $Irr(G).$ Let $ρ(G)$ be the set of primes that divide degrees in $cd(G).$ The character degree graph $Δ(G)$ of $G$ is the simple undirected graph with vertex set $ρ(G)$ and in which two distinct vertices $p$ and $q$ are adjacent if there exists a character degree $r \in cd(G)$ such that $r$ is divisible by the product $pq.$ In this paper, we obtain Laplacian eigen values and distance Laplacian eigen values of regular character degree graph, super graphs of regular character degree graph and character degree graph with diameter $2$ has two blocks.

math.GR