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

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…

A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\omega(H[B]) < \omega(H)$, and a graph $G$ is perfectly weight divisible if for every…

A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A path $P$ in a total-colored graph $G$ is called a \emph{total-proper path} if $(i)$ any two adjacent edges of $P$ are assigned distinct…

We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

We study which groups with pairing can occur as the Jacobian of a finite graph. We provide explicit constructions of graphs whose Jacobian realizes a large fraction of odd groups with a given pairing. Conditional on the generalized Riemann…

Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…