中文
相关论文

相关论文: The Structures of Zero-divisor Semigroups with Gra…

200 篇论文

A $k$-star is a complete bipartite graph $K_{1,k}$. A partial $k$-star design of order $n$ is a pair $(V,\mathcal{A})$ where $V$ is a set of $n$ vertices and $\mathcal{A}$ is a set of edge-disjoint $k$-stars whose vertex sets are subsets of…

组合数学 · 数学 2025-08-19 Ajani De Vas Gunasekara , Daniel Horsley

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

群论 · 数学 2025-11-07 Angsuman Das , Arnab Mandal , Labani Sarkar

A graph is a ``$k$-Kuratowski graph'' if it has exactly $k$ components, each isomorphic to $K_5$ or to $K_{3,3}$. We prove that if a graph $G$ contains no $k$-Kuratowski graph as a minor,then there is a set $X$ of boundedly many vertices…

组合数学 · 数学 2024-05-10 Neil Robertson , Paul Seymour

We exhibit a variety of groups that act properly and even cocompactly on median graphs (a.k.a. one-skeletons of CAT(0) cube complexes), with quasi-isometric groups that do not admit any proper action on a median graph. This answes a…

群论 · 数学 2023-05-10 Francesco Fournier-Facio , Anthony Genevois

For a positive integer $m$, a finite set of integers is said to be equidistributed modulo $m$ if the set contains an equal number of elements in each congruence class modulo $m$. In this paper, we consider the problem of determining when…

数论 · 数学 2022-05-23 Caleb McKinley Shor

In this paper, we mainly investigate $K_{1,2}$-structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $\kappa(G; K_{1,2})$ is well-defined if $diam(G)\geq 4$, or $n\equiv 1\pmod 3$, or…

组合数学 · 数学 2024-03-14 Xiao Zhao , Haojie Zheng , Hengzhe Li

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides…

群论 · 数学 2014-07-17 Adeleh Abdolghafourian , Mohammad A. Iranmanesh

The Kelmans-Seymour conjecture states that the 5-connected nonplanar graphs contain a subdivided $K_{_5}$. Certain questions of Mader propose a "plan" towards a possible resolution of this conjecture. One part of this plan is to show that a…

组合数学 · 数学 2010-12-30 Elad Aigner-Horev

For any $n$-ary associative algebra we construct a $\Z_{n-1}$ graded algebra, which is a universal object containing the $n$-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups.

环与代数 · 数学 2007-05-23 Andrzej Sitarz

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…

组合数学 · 数学 2022-10-05 Barkha Baloda , Praveen Mathil , Jitender Kumar , Aryan Barapatre

In this paper, we determine bipartite graphs and complete graphs with horns, which are realizable as zero-divisor graphs of po-semirings. As applications, we classify commutative rings $R$ whose annihilating-ideal graph $\mathbb {AG}(R)$…

环与代数 · 数学 2011-06-03 Houyi Yu , Tongsuo Wu

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

组合数学 · 数学 2025-11-19 Mariah Moschetti , Christopher O'Neill

Let $K$ be a complete graph of order $n$. For $d\in (0,1)$, let $c$ be a $\pm 1$-edge labeling of $K$ such that there are $d{n\choose 2}$ edges with label $+1$, and let $G$ be a spanning subgraph of $K$ of maximum degree at most $\Delta$.…

This paper is devoted to investigating the structure theory of a class of not-finitely graded Lie superalgebras related to generalized super-Virasoro algebras. In particular, we completely determine the derivation algebras, the automorphism…

环与代数 · 数学 2016-07-19 Juanjuan Li , Guangzhe Fan

In this paper, we find the crossing number of the complete multipartite graphs $K_{1,1,1,1,n}$, $K_{1,2,2,n}$, $K_{1,1,1,2,n}$ and $K_{1,4,n}$.

组合数学 · 数学 2013-10-17 Pak Tung Ho

In this paper, we compute universal minimal flows of groups of automorphisms of uncountable $\omega$-homogeneous graphs, $K_n$-free graphs, hypergraphs, partially ordered sets, and their extensions with an $\omega$-homogeneous ordering. We…

动力系统 · 数学 2012-04-05 Dana Bartosova

Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…

组合数学 · 数学 2014-09-02 Johannes Carmesin , Reinhard Diestel , Fabian Hundertmark , Maya Stein

Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements.…

交换代数 · 数学 2017-09-11 Marco D'Anna , Pedro A. García-Sánchez , Vincenzo Micale , Laura Tozzo

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

群论 · 数学 2024-11-20 Nguyen N. Hung , Alexander Moretó , Lucia Morotti

The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is…

组合数学 · 数学 2026-05-19 Manoj Belavadi , Chinh T. Hoang