不连通图的群不规则性强度

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-05-04 DOI:10.1016/j.disc.2025.114548

Sylwia Cichacz, Barbara Krupińska

引用次数: 0

摘要

我们研究了图的群不规则强度（sg(G)），即s的最小值，使得对于任何s阶的阿贝尔群Γ存在一个函数G:E(G)→Γ，使得每个顶点的边标记和是不同的。我们给出了不含小星星的图的（sg(G)）的界值和精确值的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Group irregularity strength of disconnected graphs

We investigate the group irregular strength

(s_{g} (G))

of graphs, i.e. the smallest value of s such that for any Abelian group Γ of order s exists a function

g : E (G) \to Γ

such that sums of edge labels at every vertex is distinct. We give results for bound and exact values of

(s_{g} (G))

for graphs without small stars as components.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.