相关论文: A family of graphs that cannot occur as character …

Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

We begin the study of character sheaves on a not necessarily connected reductive group, extending the known theory for connected groups.

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.

We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…

A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

Let $G=(V,E)$ be a graph and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose simplices are the subsets of $V$ that do not contain an independent set of size $n$ in $G$. We study the collapsibility numbers of…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…

A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…