Search

Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two distinct vertices $g, h \in G$ are adjacent if $[g] = [h]$ or there exist $x \in [g]$ and $y \in [h]$ such that $x$ and $y$ are adjacent in the A graph of $G$. In this paper, we compute spectrum of equality/conjugacy supercommuting graphs of dihedral/dicyclic groups and show that these graphs are not integral.

Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to $[m]$. Various spectra, including adjacency, Laplacian, and signless Laplacian spectra, of any graph $G$, which is a $H_m$-join of graphs is obtained by introducing the concept of $E$-main eigenvalues. More precisely, we deduce that in the case of adjacency spectra, there is an associated matrix $E_i$ of the graph $G_i$ such that a $E_i$-non-main eigenvalue of multiplicity $m_i$ of $A(G_i)$ carry forward as an eigenvalue for $A(G)$ with the same multiplicity $m_i$, while an $E_i$-main eigenvalue of multiplicity $m_i$ carry forward as an eigenvalue of $G$ with multiplicity at least $m_i - m$. As a corollary, the universal adjacency spectra of some families of graphs is obtained by realizing them as $H_m$-joins of graphs. As an application, infinite families of cospectral families of graphs are found.

Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subclasses of trees, we prove the conjecture's validity for a new class of trees that generalize proper caterpillars, thus confirming the conjecture for a broader class of trees., Comment: 11 pages

Topological indices are parameters associated with graphs that have many applications in different areas such as mathematical chemistry. Among various topological indices, the Wiener index is classical \cite{w}. In this paper, we prove a formula for the Wiener index and more general $m$-Steiner Wiener index of an arbitrary graph $G$ in terms of the cardinalities of its twin classes. In particular, we will show that calculating these parameters for the graph $G$ can be reduced to calculating the same for a much smaller graph (in general) called the reduced graph of $G$. As applications of our main result, the $m$-Steiner Wiener index is explicitly calculated for various important classes of graphs from the literature including \begin{enumerate} \item[(a)] Power graphs associated with finite groups, \item[(b)] Zero divisor graphs and the ideal-based zero divisor graphs associated with commutative rings with unity, and \item[(c)] Comaximal ideal graphs associated with commutative rings with unity. \end{enumerate} We have also found an upper bound on the $m$-Steiner Wiener index of an infinite class of graphs called the completely joined graphs. As a corollary of this result, we explicitly calculate the $m$-Steiner Wiener index of the complete multipartite graphs.

The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the sense that every finite graph is isomorphic to an induced subgraph of a zero-divisor graph. This remains true for various restricted classes of rings, including boolean rings, products of fields, and local rings. But in more restricted classes, the zero-divisor graphs do not form a universal family. For example, the zero-divisor graph of a local ring whose maximal ideal is principal is a threshold graph; and every threshold graph is embeddable in the zero-divisor graph of such a ring. More generally, we give necessary and sufficient conditions on a non-local ring for which its zero-divisor graph to be a threshold graph. In addition, we show that there is a countable local ring whose zero-divisor graph embeds the Rado graph, and hence every finite or countable graph, as induced subgraph. Finally, we consider embeddings in related graphs such as the $2$-dimensional dot product graph.

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful to study them together. In addition, several authors have considered modifying the definition of these graphs by choosing a natural equivalence relation on the group such as equality, conjugacy, or equal orders, and joining two elements if there are elements in their equivalence class that are adjacent in the original graph. In this way, we enlarge the hierarchy into a second dimension. Using the three graph types and three equivalence relations mentioned gives nine graphs, of which in general only two coincide; we find conditions on the group for some other pairs to be equal. These often define interesting classes of groups, such as EPPO groups, $2$-Engel groups, and Dedekind groups. We study some properties of graphs in this new hierarchy. In particular, we characterize the groups for which the graphs are complete, and in most cases, we characterize the dominant vertices (those joined to all others). Also, we give some results about universality, perfectness, and clique number. The paper ends with some open problems and suggestions for further work.

Let $\mathfrak g$ be a Borcherds-Kac-Moody Lie superalgebra (BKM superalgebra in short) with the associated graph $G$. Any such $\mathfrak g$ is constructed from a free Lie superalgebra by introducing three different sets of relations on the generators: (1) Chevalley relations, (2) Serre relations, and (3) Commutation relations coming from the graph $G$. By Chevalley relations we get a triangular decomposition $\mathfrak g = \mathfrak{ n_+} \oplus \mathfrak h \oplus \mathfrak n_{-}$ and each roots space $\mathfrak{ g_{\alpha}}$ is either contained in $\mathfrak{n_+}$ or $\mathfrak{ n_{-}}$. In particular, each $\mathfrak{ g_{\alpha}}$ involves only the relations (2) and (3). In this paper, we are interested in the root spaces of $\mathfrak g$ which are independent of the Serre relations. We call these roots free roots$^{1}$ of $\mathfrak g$. Since these root spaces involve only commutation relations coming from the graph $G$ we can study them combinatorially. We use heaps of pieces to study these roots and prove many combinatorial properties. We construct two different bases for these root spaces of $\mathfrak g$: One by extending the Lalonde's Lyndon heap basis of free partially commutative Lie algebras to the case of free partially commutative Lie superalgebras and the other by extending the basis given in \cite{akv17} for the free root spaces of Borcherds algebras to the case of BKM superalgebras. This is done by studying the combinatorial properties of super Lyndon heaps. We also discuss a few other combinatorial properties of free roots.

A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join, the spectra of the H-generalized join and the spectra of the generalized corona of any graphs (possibly non-regular) are obtained.

Let $\mathfrak g$ be a Borcherds algebra with the associated graph $G$. We prove that the chromatic symmetric function of $G$ can be recovered from the Weyl denominator identity of $\mathfrak g$ and this gives a Lie theoretic proof of Stanley's expression for chromatic symmetric function in terms of power sum symmetric function. Also, this gives an expression for chromatic symmetric function of $G$ in terms of root multiplicities of $\lie g$. The absolute value of the linear coefficient of the chromatic polynomial of $G$ is known as the chromatic discriminant of $G$. As an application of our main theorem, we prove that graphs with different chromatic discriminants are distinguished by their chromatic symmetric functions. Also, we find a connection between the Weyl denominators and the $G$-elementary symmetric functions. Using this connection, we give a Lie theoretic proof of non-negativity of coefficients of $G$-power sum symmetric functions., Comment: arXiv admin note: text overlap with arXiv:1612.01320

Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in terms of dimensions of the grade spaces of $\mathcal{L}(G)$. This will give us a new interpretation for the chromatic polynomials in terms of multilinear heaps and Lyndon length. The classical results of Stanley, and Greene and Zaslavsky regarding the acyclic orientations of $G$ are obtained as corollaries. A heap with a unique minimal piece is said to be a pyramid and our main theorem is proved using the properties of pyramids. For this reason, we prove two important properties of pyramids namely the pyramid proportionality lemma, and the pyramid and Lyndon heap lemma. In the last section, we will introduce the $(m,\lambda)$-labelling on acyclic orientations which is similar to Stanley's $\lambda$-compatible pairs. As an application of our main theorem, using this $(m,\lambda)$-labelled acyclic orientations, we will prove the reciprocity theorem for the derivatives of the chromatic polynomials.

The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $\alpha(G)$. There is a well known recurrence formula for $\alpha(G)$ that comes from the deletion-contraction rule for the chromatic polynomial. In this paper we prove another recurrence formula for $\alpha(G)$ that comes from the theory of Kac-Moody Lie algebras. We start with a brief survey on many interesting algebraic and combinatorial interpretations of $\alpha(G)$. We use two of these interpretations (in terms of acyclic orientations and spanning trees) to give two bijective proofs for our recurrence formula of $\alpha(G)$.

We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed formula for certain root multiplicities. Using this connection we give a second interpretation, namely that the root multiplicity of a given root coincides with the number of acyclic orientations with a unique sink of a certain graph (depending on the root). Finally, using the combinatorics of Lyndon words we construct a basis for the root spaces corresponding to these roots and determine the Hilbert series in the case when all simple roots are imaginary. As an application we give a Lie theoretic proof of Stanley's reciprocity theorem of chromatic polynomials., Comment: 23 pages, comments are welcome