Total coalitions in graphs

IF 0.6 4区数学 Q3 MATHEMATICS

Quaestiones Mathematicae Pub Date : 2024-07-07 DOI:10.2989/16073606.2024.2365365

Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi

引用次数: 0

Abstract

We define a total coalition in a graph G as a pair of disjoint subsets A1,A2 ⊆ A that satisfy the following conditions: (a) neither A1 nor A2 constitutes a total dominating set of G, and (b) A1 ∪ A...

查看原文本刊更多论文

图表中的联盟总数

我们将图 G 中的总联盟定义为满足以下条件的一对互不相交的子集 A1,A2 ⊆ A：(a) A1 和 A2 都不构成 G 的总支配集；(b) A1∪A...

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Quaestiones Mathematicae 数学-数学

CiteScore

1.70

自引率

0.00%

发文量

121

审稿时长

>12 weeks

期刊介绍： Quaestiones Mathematicae is devoted to research articles from a wide range of mathematical areas. Longer expository papers of exceptional quality are also considered. Published in English, the journal receives contributions from authors around the globe and serves as an important reference source for anyone interested in mathematics.