Discrete Applied Mathematics最新文献

英文中文

Forbidden Pairs of disconnected graphs for traceability and hamiltonicity

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-12 DOI: 10.1016/j.dam.2025.04.002

Hongli Liao, Qiang Wang, Liming Xiong, Zhang Zhang

In this paper, we firstly characterize all forbidden pairs

{R, S}

for graphs with a spanning trail that are traceable and traceable graphs that are hamiltonian. There is no change of forbidden pairs for hamiltonicity if we impose a necessary condition of assumption that the graph is traceable; however, there is some difference of forbidden pairs for traceability if we impose a necessary condition that the graph has a spanning trail: different on two pairs of forbidden subgraphs

{K_{1, 3}, Z_{2} \cup K_{1}}, {K_{1, 4}, Z_{1}}

(where

Z_{i}

is the graph obtained by identifying a vertex of a

K_{3}

with an end-vertex of a

P_{i + 1}

As a byproduct, we prove that if

G

is a connected

{K_{1, 4}, Z_{1}}

-free graph, then every subgraph

G [T]

induced by a trail

T

is traceable and every subgraph

G [T]

induced by a closed trail

T

is either hamiltonian or

K_{2} \lor 3 K_{1}

引用次数: 0

Three results towards approximation of special maximum matchings in graphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-12 DOI: 10.1016/j.dam.2025.04.005

Vahan Mkrtchyan

For a graph

G

define the parameters

ℓ (G)

and

L (G)

as the minimum and maximum value of

ν (G ∖ F)

, where

F

is a maximum matching of

G

and

ν (G)

is the matching number of

G

. In this paper, we show that there is a small constant

c > 0

, such that the following decision problem is NP-complete: given a graph

G

and

k \leq \frac{| V |}{2}

, check whether there is a maximum matching

F

G

, such that

| ν (G ∖ F) - k | \leq c \cdot | V |

. Note that when

c = 1

, this problem is polynomial time solvable as we observe in the paper. Since in any graph

G

, we have

L (G) \leq 2 ℓ (G)

, any polynomial time algorithm constructing a maximum matching of a graph is a 2-approximation algorithm for

ℓ (G)

and

\frac{1}{2}

-approximation algorithm for

L (G)

. We complement these observations by presenting two inapproximability results for

ℓ (G)

and

L (G)

引用次数: 0

Finding spanning trees with perfect matchings

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-11 DOI: 10.1016/j.dam.2025.04.001

Kristóf Bérczi , Tamás Király , Yusuke Kobayashi , Yutaro Yamaguchi , Yu Yokoi

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight spanning tree among those containing a perfect matching. On the positive side, we design a simple greedy algorithm for the case when the graph is complete (or complete bipartite) and the edge weights take at most two values. On the negative side, the problem is NP-hard even when the graph is complete (or complete bipartite) and the edge weights take at most three values, or when the graph is cubic, planar, and bipartite and the edge weights take at most two values.

We also consider an interesting variant. We call a tree strongly balanced if on one side of the bipartition of the vertex set with respect to the tree, all but one of the vertices have degree 2 and the remaining one is a leaf. This property is a sufficient condition for a tree to have a perfect matching, which enjoys some structural property in addition. When the underlying graph is bipartite, strongly balanced spanning trees can be written as matroid intersection, and this fact was utilized to design approximation algorithms for several NP-hard problems, e.g., the traveling salesman problem and a kind of connectivity augmentation problem. The natural question is its tractability in nonbipartite graphs. As a negative answer, it turns out NP-hard to test whether a given graph has a strongly balanced spanning tree or not even when the graph is subcubic and planar.

{"title":"Finding spanning trees with perfect matchings","authors":"Kristóf Bérczi , Tamás Király , Yusuke Kobayashi , Yutaro Yamaguchi , Yu Yokoi","doi":"10.1016/j.dam.2025.04.001","DOIUrl":"10.1016/j.dam.2025.04.001","url":null,"abstract":"<div><div>We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight spanning tree among those containing a perfect matching. On the positive side, we design a simple greedy algorithm for the case when the graph is complete (or complete bipartite) and the edge weights take at most two values. On the negative side, the problem is NP-hard even when the graph is complete (or complete bipartite) and the edge weights take at most three values, or when the graph is cubic, planar, and bipartite and the edge weights take at most two values.</div><div>We also consider an interesting variant. We call a tree strongly balanced if on one side of the bipartition of the vertex set with respect to the tree, all but one of the vertices have degree 2 and the remaining one is a leaf. This property is a sufficient condition for a tree to have a perfect matching, which enjoys some structural property in addition. When the underlying graph is bipartite, strongly balanced spanning trees can be written as matroid intersection, and this fact was utilized to design approximation algorithms for several NP-hard problems, e.g., the traveling salesman problem and a kind of connectivity augmentation problem. The natural question is its tractability in nonbipartite graphs. As a negative answer, it turns out NP-hard to test whether a given graph has a strongly balanced spanning tree or not even when the graph is subcubic and planar.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"371 ","pages":"Pages 137-147"},"PeriodicalIF":1.0,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143815362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fault-tolerant strong Menger connectivity with conditional faults on wheel networks

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-11 DOI: 10.1016/j.dam.2025.04.019

Shiying Wang , Lina Zhao , Su Wang

<div><div>An interconnection network is usually modeled as a graph, where vertex and edge correspond the processor and the link between two distinct processors, respectively. Connectivity is an important metric for the fault tolerance in interconnection networks. A connected graph <math><mi>G</mi></math> is called strongly Menger connected if each pair of vertices <math><mi>u</mi></math> and <math><mi>v</mi></math> are connected by <math><mrow><mo>min</mo><mrow><mo>{</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>u</mi><mo>)</mo></mrow><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mo>}</mo></mrow></mrow></math> vertex-disjoint paths in <math><mi>G</mi></math>. A graph <math><mi>G</mi></math> is called <math><mi>m</mi></math>-fault-tolerant strongly Menger (<math><mi>m</mi></math>-FTSM for short) connected if <math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math> remains strongly Menger connected for any <math><mrow><mi>F</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> with <math><mrow><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>≤</mo><mi>m</mi></mrow></math>. A graph <math><mi>G</mi></math> is called <math><mi>m</mi></math>-conditional fault-tolerant strongly Menger (<math><mi>m</mi></math>-CFTSM for short) connected if <math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math> remains strongly Menger connected for any <math><mrow><mi>F</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> with <math><mrow><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>≤</mo><mi>m</mi></mrow></math> and <math><mrow><mi>δ</mi><mrow><mo>(</mo><mi>G</mi><mo>−</mo><mi>F</mi><mo>)</mo></mrow><mo>≥</mo><mn>2</mn></mrow></math>. In this paper, we show that <math><mi>n</mi></math>-dimensional wheel network <math><mrow><mi>C</mi><msub><mrow><mi>W</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math> is <math><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>4</mn><mo>)</mo></mrow></math>-FTSM connected for <math><mrow><mi>n</mi><mo>≥</mo><mn>4</mn></mrow></math>, <math><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>5</mn><mo>)</mo></mrow></math>-fault-tolerant one-to-many strongly Menger connected for <math><mrow><mi>n</mi><mo>≥</mo><mn>4</mn></mrow></math>, and <math><mrow><mo>(</mo><mn>4</mn><mi>n</mi><mo>−</mo><mn>10</mn><mo>)</mo></mrow></math>-CFTSM connected for <math><mrow><mi>n</mi><mo>≥</mo><mn>5</mn></mrow></math>. Moreover, the bounds <math><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>4</mn><mo>)</mo></mrow></math>, <math><mrow><mo>(</m

引用次数: 0

The cyclic diagnosability of Cayley graphs generated by transposition trees 转置树生成的 Cayley 图的循环可诊断性

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-11 DOI: 10.1016/j.dam.2025.04.012

Weixing Zheng , Shuming Zhou , Eddie Cheng , Qifan Zhang

The system’s self diagnosis capability is a critical indicator for the reliability of multiprocessor systems, which plays a key role in ensuring the smooth operation of big data processing and cloud computing. Cycle structures, which bring redundant paths for secure communication, enhance network reliability significantly. Based on cyclic connectivity, cyclic diagnosability has been proposed and has witnessed a small amount of progress. Although the metric relationship between cyclic connectivity and cyclic diagnosability has been established, the flexibility of generating graph of Cayley graphs prevents this metric relationship from being directly applied to characterize the cyclic diagnosability of all Cayley graphs generated by transposition trees. In this paper, we classify the generating transposition trees based on the diameter and the number of matchings, and determine the cyclic diagnosability of Cayley graphs generated by these transposition trees under PMC and MM* models.

引用次数: 0

Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-10 DOI: 10.1016/j.dam.2025.04.006

Xueyi Huang , Lu Lu , Xiongfeng Zhan

Distance-regular graphs constitute an important class of regular graphs exhibiting remarkable combinatorial symmetry. In 2007, Miklavič and Potočnik initiated the systematic study of distance-regular Cayley graphs, extending the classical problem of characterizing strongly regular Cayley graphs (equivalent to investigating regular partial difference sets). In this paper, we provide a partial characterization of distance-regular Cayley graphs over semi-dihedral groups and pseudo-semi-dihedral groups, both of which are 2-groups that contain a cyclic subgroup of index 2.

引用次数: 0

A note on extremal trees for a bound on the double domination number

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-10 DOI: 10.1016/j.dam.2025.04.007

Ravi Kalaiyarasi , Mustapha Chellali , Yanamandram B. Venkatakrishnan

In a graph

G,

a vertex is said to dominate itself and its neighbors. A subset

D

V (G)

is a double dominating set if every vertex of

V (G)

is dominated at least twice by the vertices of

D

. The double domination number

γ_{\times 2} (G)

is the minimum cardinality among all double dominating sets of

G

. Cabrera-Martínez proved that for every nontrivial tree

T

of order

n (T)

with

ℓ (T)

leaves and

s (T)

support vertices,

γ_{\times 2} (T) \geq \frac{1}{2} (n (T) - γ (T) + ℓ (T) + s (T) + 1),

where

γ (T)

stands for the domination number of

T .

In this note, we provide a constructive characterization of trees attaining this bound in response to the problem raised by Cabrera-Martínez.

在图 G 中，一个顶点可以支配它自己和它的邻近顶点。如果 V(G) 的每个顶点至少被 D 的顶点支配两次，则 V(G) 的子集 D 是双重支配集。卡布雷拉-马丁内斯（Cabrera-Martínez）证明，对于每一棵阶为 n(T)、有 ℓ(T) 个叶子和 s(T) 个支持顶点的非琐树 T，γ×2(T)≥12(n(T)-γ(T)+ℓ(T)+s(T)+1)，其中 γ(T) 代表 T 的支配数。

引用次数: 0

On the outdegree zeroth-order general Randić index of digraphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-10 DOI: 10.1016/j.dam.2025.04.010

Jiaxiang Yang , Hechao Liu , Xuesong Fu

For any digraph

D

and real number

α

, the outdegree zeroth-order general Randić index is defined as the sum of the outdegree of each vertex raised to the power of

α

across all vertices in the digraph

D

. A cactus graph

G

is a connected graph in which each block of

G

is either an edge or a cycle. An oriented cactus is the directed variant of a cactus graph, where each edge has a specified direction. For any real number

α \geq 2

and positive integers

n

r

with

n > 2 r

, we address the problem of identifying the maximum value of the outdegree zeroth-order general Randić index among oriented cacti with

n

vertices and

r

cycles. Additionally, we determine the maximum value of the outdegree zeroth-order general Randić index over connected simple digraphs with

n

vertices and

l

arcs, where

l

is a positive integer. In particular, for

α = 2

, we obtain some of the results obtained in Ganie and Pirzada, (2024).

{"title":"On the outdegree zeroth-order general Randić index of digraphs","authors":"Jiaxiang Yang , Hechao Liu , Xuesong Fu","doi":"10.1016/j.dam.2025.04.010","DOIUrl":"10.1016/j.dam.2025.04.010","url":null,"abstract":"<div><div>For any digraph <math><mi>D</mi></math> and real number <math><mi>α</mi></math>, the outdegree zeroth-order general Randić index is defined as the sum of the outdegree of each vertex raised to the power of <math><mi>α</mi></math> across all vertices in the digraph <math><mi>D</mi></math>. A cactus graph <math><mi>G</mi></math> is a connected graph in which each block of <math><mi>G</mi></math> is either an edge or a cycle. An oriented cactus is the directed variant of a cactus graph, where each edge has a specified direction. For any real number <math><mrow><mi>α</mi><mo>≥</mo><mn>2</mn></mrow></math> and positive integers <math><mi>n</mi></math>, <math><mi>r</mi></math> with <math><mrow><mi>n</mi><mo>></mo><mn>2</mn><mi>r</mi></mrow></math>, we address the problem of identifying the maximum value of the outdegree zeroth-order general Randić index among oriented cacti with <math><mi>n</mi></math> vertices and <math><mi>r</mi></math> cycles. Additionally, we determine the maximum value of the outdegree zeroth-order general Randić index over connected simple digraphs with <math><mi>n</mi></math> vertices and <math><mi>l</mi></math> arcs, where <math><mi>l</mi></math> is a positive integer. In particular, for <math><mrow><mi>α</mi><mo>=</mo><mn>2</mn></mrow></math>, we obtain some of the results obtained in Ganie and Pirzada, (2024).</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"372 ","pages":"Pages 76-86"},"PeriodicalIF":1.0,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Rainbow transitive triangles in arc-colored digraphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-10 DOI: 10.1016/j.dam.2025.04.011

Mengyu Duan , Zhiwei Guo , Binlong Li , Shenggui Zhang

<div><div>A subdigraph of an arc-colored digraph is rainbow if its all arcs have distinct colors. For two digraphs <math><mi>D</mi></math> and <math><mi>H</mi></math>, let <math><mrow><mi>r</mi><mi>b</mi><mrow><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></mrow></mrow></math> be the minimum integer such that every arc-colored digraph <math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math> with <math><mrow><mi>c</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow><mo>≥</mo><mi>r</mi><mi>b</mi><mrow><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></mrow></mrow></math> contains a rainbow copy of <math><mi>H</mi></math>, where <math><mrow><mi>c</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow></mrow></math> is the number of colors of <math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math>. Let <math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math> be the digraph obtained from the complete graph <math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math> by replacing each edge <math><mrow><mi>u</mi><mi>v</mi></mrow></math> with a pair of symmetric arcs <math><mrow><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></mrow></math> and <math><mrow><mo>(</mo><mi>v</mi><mo>,</mo><mi>u</mi><mo>)</mo></mrow></math>, and let <math><mover><mrow><msub><mrow><mi>T</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mo>⃗</mo></mover></math> be the transitive triangle. In this paper we determine <math><mrow><mi>r</mi><mi>b</mi><mrow><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</mo><mover><mrow><msub><mrow><mi>T</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mo>⃗</mo></mover><mo>)</mo></mrow></mrow></math> and characterize the corresponding extremal arc-colorings of <math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math>. Further, we prove that an arc-colored digraph <math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math> on <math><mi>n</mi></math> vertices contains a rainbow <math><mover><mrow><msub><mrow><mi>T</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mo>⃗</mo></mover></math> if <math><mrow><mi>a</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow><mo>+</mo><mi>c</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow><mo>≥</mo><mi>a</mi><mrow><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>)</mo></mrow><mo>+</mo><mi>r</mi><mi>b</mi><mrow><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</

引用次数: 0

Unitary Cayley graphs of finite semisimple rings

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-04-10 DOI: 10.1016/j.dam.2025.04.008

Thanatach Tangsakul, Yotsanan Meemark

<div><div>Let <math><mi>R</mi></math> be a finite ring with identity <math><mrow><mn>1</mn><mo>≠</mo><mn>0</mn></mrow></math>. The unitary Cayley graph of <math><mi>R</mi></math>, denoted by <math><msub><mrow><mi>G</mi></mrow><mrow><mi>R</mi></mrow></msub></math>, is a graph whose vertices are elements of <math><mi>R</mi></math> and <math><mrow><mi>x</mi><mo>,</mo><mi>y</mi></mrow></math> are adjacent if and only if <math><mrow><mi>x</mi><mo>−</mo><mi>y</mi></mrow></math> is a unit in <math><mi>R</mi></math>. A ring <math><mi>R</mi></math> is called a <math><mrow><mi>D</mi><mi>U</mi></mrow></math>-ring if for any ring <math><mi>S</mi></math> such that <math><mrow><msub><mrow><mi>G</mi></mrow><mrow><mi>R</mi></mrow></msub><mo>≅</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub></mrow></math>, then <math><mrow><mi>R</mi><mo>≅</mo><mi>S</mi></mrow></math>. In this paper, we study unitary Cayley graphs of finite semisimple rings and show that finite semisimple rings of the form <math><mrow><msub><mrow><mi>M</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>F</mi></mrow><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msub><mo>)</mo></mrow><mo>×</mo><mo>⋯</mo><mo>×</mo><msub><mrow><mi>M</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>F</mi></mrow><mrow><msub><mrow><mi>q</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msub><mo>)</mo></mrow></mrow></math> where <math><mrow><msub><mrow><mi>M</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>F</mi></mrow><mrow><msub><mrow><mi>q</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></msub><mo>)</mo></mrow><mo>≠</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math> for all <math><mrow><mi>i</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></mrow></mrow></math> are <math><mrow><mi>D</mi><mi>U</mi></mrow></math>-rings. We achieve this by using the Cartesian skeleton of the graph to show that <math><msub><mrow><mi>G</mi></mrow><mrow><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>)</mo></mrow></mrow></msub></math> is prime with respect to the direct product and deduce the result through the uniqueness of graph factorization. In addition, we show that any finite commutative reduced ring is a <math><mrow><mi>D</mi><mi>U</mi></mrow></math>-ring by combining graph cancellation properties with combinatorial arguments on the eigenvalues of the unitary Cayley graph o

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Discrete Applied Mathematics

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀