相关论文: Finite connected components of the aliquot graph

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

We prove the existence of a function f: N^2 -> N such that for all p,k in N every (k(p-3) + 14p+14) - connected graph either has k disjoint K_p minors or contains a set of at most f(p,k) vertices whose deletion kills all its K_p minors. For…

The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2,…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Let $G$ be a finite simple graph with edge ideal $I(G)$. Let $J(G)$ denote the Alexander dual of $I(G)$. We show that a description of all induced cycles of odd length in $G$ is encoded in the associated primes of $J(G)^2$. This result…

In 1979 Goldfeld conjectured: 50\% of the quadratic twists of an elliptic curve defined over the rationals have analytic rank zero. In this expository article we present a few recent developments towards the conjecture, especially its first…

This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$…

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

In this paper, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order $n$ whose metric subgraphs are all paths if and only…

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of $F$ in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits,…