Discrete Applied Mathematics最新文献

英文中文

On group-valued potential differences and flows in a signed graph

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-27 DOI: 10.1016/j.dam.2025.01.035

Xiangyu Ren , Jianguo Qian

<div><div>A signed graph <math><mrow><mi>Σ</mi><mo>=</mo><mrow><mo>(</mo><mi>G</mi><mo>,</mo><mi>σ</mi><mo>)</mo></mrow></mrow></math> is a graph associated with a signature <math><mi>σ</mi></math> on each edge (positive or negative). Let <math><mi>Γ</mi></math> be an additive abelian group and <math><mi>τ</mi></math> be an orientation of <math><mi>Σ</mi></math>. Let <math><mrow><mi>f</mi><mo>:</mo><mi>E</mi><mo>→</mo><mi>Γ</mi></mrow></math> be a mapping. Then <math><mi>f</mi></math> is a <math><mi>Γ</mi></math>-flow if for each vertex <math><mrow><munder><mrow><mo>∑</mo></mrow><mrow><mrow><mo>(</mo><mi>v</mi><mo>,</mo><mi>e</mi><mo>)</mo></mrow><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow></mrow></munder><mi>τ</mi><mrow><mo>(</mo><mi>v</mi><mo>,</mo><mi>e</mi><mo>)</mo></mrow><mi>f</mi><mrow><mo>(</mo><mi>e</mi><mo>)</mo></mrow><mo>=</mo><mn>0</mn><mo>,</mo></mrow></math> <math><mi>f</mi></math> is a <math><mi>Γ</mi></math>-tension if for every signed circuit <math><mrow><mi>C</mi><mo>=</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>v</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⋯</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>k</mi></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mi>k</mi></mrow></msub><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></math>, <math><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>k</mi></mrow></munderover><mfenced><mrow><mo>−</mo><mi>τ</mi><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo></mrow><munderover><mrow><mo>∏</mo></mrow><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>i</mi><mo>−</mo><mn>1</mn></mrow></munderover><mi>σ</mi><mrow><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo></mrow></mrow></mfenced><mi>f</mi><mrow><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo></mrow><mo>=</mo><mn>0</mn><mo>,</mo></mrow></math> and <math><mi>f</mi></math> is a <math><mi>Γ</mi></math>-potential difference if <math><mi>f</mi></math> is a <math><mi>Γ</mi></math>-tension such that for every closed walk <math><mrow><mi>W</mi><mo>=</mo><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>v</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⋯</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>k</mi></mrow></msub><msub><mrow><mi>e</mi></mrow><mrow><mi>k</mi></mrow></msu

引用次数: 0

Domination number, independent domination number and k-independence number in trees

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-27 DOI: 10.1016/j.dam.2025.01.036

Qing Cui, Xu Zou

For any graph

G

, let

γ (G)

and

i (G)

denote the domination number and the independent domination number of

G

, respectively. For any positive integer

k

, a subset

S

of vertices in a graph

G

is said to be a

k

-independent set of

G

G [S]

has maximum degree less than

k

. The

k

-independence number of

G

, denoted by

α_{k} (G)

, is the maximum cardinality of a

k

-independent set of

G

. Let

T

be any tree with

n \geq 2

vertices. Dehgardi et al. proved that

i (T) \leq \frac{3}{4} α_{2} (T)

and

γ (T) + i (T) \leq \frac{4}{3} α_{2} (T)

. Later, Zhang and Wu extended the former result of Dehgardi et al. by showing that

i (T) \leq \frac{k + 1}{2 k} α_{k} (T)

, and conjectured that the latter one can also be generalized to

γ (T) + i (T) \leq \frac{2 k}{2 k - 1} α_{k} (T)

. In this paper, we prove this conjecture, and moreover, we characterize all extremal trees for which the equality holds.

引用次数: 0

Perfect out-forest problem and directed Steiner cycle packing problem

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-27 DOI: 10.1016/j.dam.2025.01.027

Yuefang Sun , Zemin Jin

The perfect out-forest problem generalizes the perfect matching problem, and the directed Steiner cycle packing problem generalizes the Hamiltonian cycle decomposition problem and is a variant of the directed Steiner tree packing problem. In this paper, we study the complexity of these two types of digraph packing problems.

For the perfect out-forest problem, Gutin and Yeo proved that it is NP-complete to decide whether a given strong digraph contains a 0-perfect out-forest. We show that this result also holds for the 1-perfect out-forest problem. However, when restricted to a semicomplete digraph

D

, the problem of deciding whether

D

contains an

i

-perfect out-forest becomes polynomial-time solvable, where

i \in {0, 1}

. In addition, we prove that it is NP-hard to find a 0-perfect out-forest of maximum size in a connected acyclic digraph, and it is NP-hard to find a 1-perfect out-forest of maximum size in a connected digraph.

For the directed Steiner cycle packing problem, when both

k \geq 2, ℓ \geq 1

are fixed integers, we show that the problem of deciding whether there are at least

ℓ

internally disjoint directed

S

-Steiner cycles in a digraph

D

is NP-complete, where

S \subseteq V (D)

and

| S | = k

. However, when we consider the class of symmetric digraphs, the problem becomes polynomial-time solvable. We also show that the problem of deciding whether there are at least

ℓ

arc-disjoint directed

S

-Steiner cycles in a given digraph

D

is NP-complete, where

S \subseteq V (D)

and

| S | = k

{"title":"Perfect out-forest problem and directed Steiner cycle packing problem","authors":"Yuefang Sun , Zemin Jin","doi":"10.1016/j.dam.2025.01.027","DOIUrl":"10.1016/j.dam.2025.01.027","url":null,"abstract":"<div><div>The perfect out-forest problem generalizes the perfect matching problem, and the directed Steiner cycle packing problem generalizes the Hamiltonian cycle decomposition problem and is a variant of the directed Steiner tree packing problem. In this paper, we study the complexity of these two types of digraph packing problems.</div><div>For the perfect out-forest problem, Gutin and Yeo proved that it is NP-complete to decide whether a given strong digraph contains a 0-perfect out-forest. We show that this result also holds for the 1-perfect out-forest problem. However, when restricted to a semicomplete digraph <math><mi>D</mi></math>, the problem of deciding whether <math><mi>D</mi></math> contains an <math><mi>i</mi></math>-perfect out-forest becomes polynomial-time solvable, where <math><mrow><mi>i</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow></mrow></math>. In addition, we prove that it is NP-hard to find a 0-perfect out-forest of maximum size in a connected acyclic digraph, and it is NP-hard to find a 1-perfect out-forest of maximum size in a connected digraph.</div><div>For the directed Steiner cycle packing problem, when both <math><mrow><mi>k</mi><mo>≥</mo><mn>2</mn><mo>,</mo><mi>ℓ</mi><mo>≥</mo><mn>1</mn></mrow></math> are fixed integers, we show that the problem of deciding whether there are at least <math><mi>ℓ</mi></math> internally disjoint directed <math><mi>S</mi></math>-Steiner cycles in a digraph <math><mi>D</mi></math> is NP-complete, where <math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow></mrow></math> and <math><mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mo>=</mo><mi>k</mi></mrow></math>. However, when we consider the class of symmetric digraphs, the problem becomes polynomial-time solvable. We also show that the problem of deciding whether there are at least <math><mi>ℓ</mi></math> arc-disjoint directed <math><mi>S</mi></math>-Steiner cycles in a given digraph <math><mi>D</mi></math> is NP-complete, where <math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>D</mi><mo>)</mo></mrow></mrow></math> and <math><mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mo>=</mo><mi>k</mi></mrow></math>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"366 ","pages":"Pages 201-209"},"PeriodicalIF":1.0,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143161754","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

A biased edge coloring game

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-27 DOI: 10.1016/j.dam.2025.01.028

Runze Wang

We combine the ideas of edge coloring games and asymmetric graph coloring games and define the

(m, 1)

-edge coloring game, which is alternatively played by two players Maker and Breaker on a finite simple graph

G

with a set of colors

X

. Maker plays first and colors

m

uncolored edges on each turn. Breaker colors only one uncolored edge on each turn. They make sure that adjacent edges get distinct colors. Maker wins if eventually every edge is colored; Breaker wins if at some point, the player who is playing cannot color any edge. We define the

(m, 1)

-game chromatic index of

G

to be the smallest nonnegative integer

k

such that Maker has a winning strategy with

| X | = k

. We give some general upper bounds on the

(m, 1)

-game chromatic indices of trees, determine the exact

(m, 1)

-game chromatic indices of some caterpillars and all wheels, and show that larger

m

does not necessarily give us smaller

(m, 1)

-game chromatic index.

{"title":"A biased edge coloring game","authors":"Runze Wang","doi":"10.1016/j.dam.2025.01.028","DOIUrl":"10.1016/j.dam.2025.01.028","url":null,"abstract":"<div><div>We combine the ideas of edge coloring games and asymmetric graph coloring games and define the <math><mrow><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math>-edge coloring game, which is alternatively played by two players Maker and Breaker on a finite simple graph <math><mi>G</mi></math> with a set of colors <math><mi>X</mi></math>. Maker plays first and colors <math><mi>m</mi></math> uncolored edges on each turn. Breaker colors only one uncolored edge on each turn. They make sure that adjacent edges get distinct colors. Maker wins if eventually every edge is colored; Breaker wins if at some point, the player who is playing cannot color any edge. We define the <math><mrow><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math>-game chromatic index of <math><mi>G</mi></math> to be the smallest nonnegative integer <math><mi>k</mi></math> such that Maker has a winning strategy with <math><mrow><mrow><mo>|</mo><mi>X</mi><mo>|</mo></mrow><mo>=</mo><mi>k</mi></mrow></math>. We give some general upper bounds on the <math><mrow><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math>-game chromatic indices of trees, determine the exact <math><mrow><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math>-game chromatic indices of some caterpillars and all wheels, and show that larger <math><mi>m</mi></math> does not necessarily give us smaller <math><mrow><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math>-game chromatic index.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"366 ","pages":"Pages 193-200"},"PeriodicalIF":1.0,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160547","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

The k-general d-position problem for graphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-24 DOI: 10.1016/j.dam.2025.01.025

Brent Cody, Garrett Moore

A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common shortest path. Recently Klavžar, Rall and Yero generalized this notion by defining a set of vertices to be in general

d

-position if no three vertices from the set lie on a common shortest path of length at most

d

. We generalize this notion further by defining a set of vertices to be in

k

-general

d

-position if no

k

vertices of the set lie on a common shortest path of length at most

d

. The

k

-general

d

-position number of a graph is the largest cardinality of a

k

-general

d

-position set. We provide upper and lower bounds on the

k

-general

d

-position number of graphs in terms of the

k

-general

d

-position number of certain kinds of subgraphs. We compute the

k

-general

d

-position number of finite paths and cycles. Along the way we establish that the maximally even subsets of cycles, which were introduced in Clough and Douthett’s work on music theory, provide the largest possible

k

-general

d

-position sets in

n

-cycles. We generalize Klavžar and Manuel’s notion of monotone-geodesic labeling to that of

k

-monotone-geodesic labeling in order to calculate the

k

-general

d

-position number of the infinite two-dimensional grid. We also prove a formula for the

k

-general

d

-position number of certain thin finite grids, providing a partial answer to a question asked by Klavžar, Rall and Yero.

{"title":"The k-general d-position problem for graphs","authors":"Brent Cody, Garrett Moore","doi":"10.1016/j.dam.2025.01.025","DOIUrl":"10.1016/j.dam.2025.01.025","url":null,"abstract":"<div><div>A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common shortest path. Recently Klavžar, Rall and Yero generalized this notion by defining a set of vertices to be in general <math><mi>d</mi></math>-position if no three vertices from the set lie on a common shortest path of length at most <math><mi>d</mi></math>. We generalize this notion further by defining a set of vertices to be in <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position if no <math><mi>k</mi></math> vertices of the set lie on a common shortest path of length at most <math><mi>d</mi></math>. The <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of a graph is the largest cardinality of a <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position set. We provide upper and lower bounds on the <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of graphs in terms of the <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of certain kinds of subgraphs. We compute the <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of finite paths and cycles. Along the way we establish that the maximally even subsets of cycles, which were introduced in Clough and Douthett’s work on music theory, provide the largest possible <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position sets in <math><mi>n</mi></math>-cycles. We generalize Klavžar and Manuel’s notion of monotone-geodesic labeling to that of <math><mi>k</mi></math>-monotone-geodesic labeling in order to calculate the <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of the infinite two-dimensional grid. We also prove a formula for the <math><mi>k</mi></math>-general <math><mi>d</mi></math>-position number of certain thin finite grids, providing a partial answer to a question asked by Klavžar, Rall and Yero.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"366 ","pages":"Pages 135-151"},"PeriodicalIF":1.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160890","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

The complexity of cluster vertex splitting and company

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-24 DOI: 10.1016/j.dam.2025.01.012

Alexander Firbas , Alexander Dobler , Fabian Holzer, Jakob Schafellner, Manuel Sorge , Anaïs Villedieu, Monika Wißmann

Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster structure, or we may split vertices to separate the clusters from each other. Splitting a vertex

v

means to remove it and to add two new copies of

v

and to make each previous neighbor of

v

adjacent with at least one of the copies. In this work, we study underlying computational problems regarding the three angles to overlapping clusterings, in particular when the overlap is small. We show that the above-mentioned covering problem is NP-complete. We then make structural observations that show that the covering viewpoint and the vertex-splitting viewpoint are equivalent, yielding NP-hardness for the vertex-splitting problem. On the positive side, we show that splitting at most

k

vertices to obtain a cluster graph has a problem kernel with

O (k)

vertices. Finally, we observe that combining our hardness results with structural observations and a so-called critical-clique lemma yields a simple alternative NP-hardness proof for the Cluster Editing With Vertex Splitting problem, where we add or delete edges and split vertices to obtain a cluster graph.

{"title":"The complexity of cluster vertex splitting and company","authors":"Alexander Firbas , Alexander Dobler , Fabian Holzer, Jakob Schafellner, Manuel Sorge , Anaïs Villedieu, Monika Wißmann","doi":"10.1016/j.dam.2025.01.012","DOIUrl":"10.1016/j.dam.2025.01.012","url":null,"abstract":"<div><div>Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster structure, or we may split vertices to separate the clusters from each other. Splitting a vertex <math><mi>v</mi></math> means to remove it and to add two new copies of <math><mi>v</mi></math> and to make each previous neighbor of <math><mi>v</mi></math> adjacent with at least one of the copies. In this work, we study underlying computational problems regarding the three angles to overlapping clusterings, in particular when the overlap is small. We show that the above-mentioned covering problem is NP-complete. We then make structural observations that show that the covering viewpoint and the vertex-splitting viewpoint are equivalent, yielding NP-hardness for the vertex-splitting problem. On the positive side, we show that splitting at most <math><mi>k</mi></math> vertices to obtain a cluster graph has a problem kernel with <math><mrow><mi>O</mi><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mrow></math> vertices. Finally, we observe that combining our hardness results with structural observations and a so-called critical-clique lemma yields a simple alternative NP-hardness proof for the Cluster Editing With Vertex Splitting problem, where we add or delete edges and split vertices to obtain a cluster graph.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"365 ","pages":"Pages 190-207"},"PeriodicalIF":1.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143150697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Testing popularity in linear time via maximum matching

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-24 DOI: 10.1016/j.dam.2025.01.014

Erika Bérczi-Kovács , Kata Kosztolányi

Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph

G = (V, E)

with strict preferences on the neighbors of the nodes, a matching

M

is popular if there is no other matching

M^{'}

such that the number of nodes preferring

M^{'}

is more than those preferring

M

. This paper considers the popularity testing problem, when the task is to decide whether a given matching is popular or not. Previous algorithms applied reductions to maximum weight matchings. We give a new algorithm for testing popularity by reducing the problem to maximum matching testing, thus attaining a linear running time

O (| E |)

Linear programming-based characterization of popularity is often applied for proving the popularity of a certain matching. As a consequence of our algorithm we derive a more structured dual witness than previous ones. Based on this result we give a combinatorial characterization of fractional popular matchings, which is a special class of popular matchings.

{"title":"Testing popularity in linear time via maximum matching","authors":"Erika Bérczi-Kovács , Kata Kosztolányi","doi":"10.1016/j.dam.2025.01.014","DOIUrl":"10.1016/j.dam.2025.01.014","url":null,"abstract":"<div><div>Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph <math><mrow><mi>G</mi><mo>=</mo><mrow><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></mrow></math> with strict preferences on the neighbors of the nodes, a matching <math><mi>M</mi></math> is popular if there is no other matching <math><msup><mrow><mi>M</mi></mrow><mrow><mo>′</mo></mrow></msup></math> such that the number of nodes preferring <math><msup><mrow><mi>M</mi></mrow><mrow><mo>′</mo></mrow></msup></math> is more than those preferring <math><mi>M</mi></math>. This paper considers the popularity testing problem, when the task is to decide whether a given matching is popular or not. Previous algorithms applied reductions to maximum weight matchings. We give a new algorithm for testing popularity by reducing the problem to maximum matching testing, thus attaining a linear running time <math><mrow><mi>O</mi><mrow><mo>(</mo><mo>|</mo><mi>E</mi><mo>|</mo><mo>)</mo></mrow></mrow></math>.</div><div>Linear programming-based characterization of popularity is often applied for proving the popularity of a certain matching. As a consequence of our algorithm we derive a more structured dual witness than previous ones. Based on this result we give a combinatorial characterization of fractional popular matchings, which is a special class of popular matchings.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"366 ","pages":"Pages 152-160"},"PeriodicalIF":1.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143161750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the hardness of problems around s-clubs on split graphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-24 DOI: 10.1016/j.dam.2025.01.023

Cristina Bazgan , Pinar Heggernes , André Nichterlein , Thomas Pontoizeau

We investigate the complexity of problems related to

s

-clubs. Given a graph, an

s

-club is a subset of vertices such that the subgraph induced by it has diameter at most

s

. We show that partitioning a split graph into two 2-clubs is NP-hard. Moreover, we prove that finding the minimum number of edges to add to a split graph in order to obtain a diameter of at most 2 is W[2]-hard with respect to the number of edges to add. Finally we show that finding the minimum number of edges to keep within a split graph of diameter 2 or 3 in order to maintain its diameter is NP-complete.

引用次数: 0

The Gowers U3 norm of one family of cubic power permutations

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-24 DOI: 10.1016/j.dam.2025.01.024

Zhaole Li , Deng Tang

<div><div>The Gowers uniformity norm has emerged as a significant metric in the evaluation of Boolean functions employed in symmetric-key encryptions, particularly in assessing their resilience against low degree approximation attacks. Beyond cryptography, this norm plays a pivotal role in theoretical computer science, including pseudorandomness and property testing of Boolean functions. However, the determination of the Gowers <math><msub><mrow><mi>U</mi></mrow><mrow><mi>k</mi></mrow></msub></math> norm for <math><mrow><mi>k</mi><mo>≥</mo><mn>3</mn></mrow></math> for general Boolean functions presents substantial computational and theoretical challenges. Recently, the relationship between the Gowers uniformity norm and the higher-order differential spectrum of Boolean functions has been derived. Furthermore, the fact that the Gowers uniformity norm of a power permutation can be determined by the Gowers uniformity norm of its any component function. In this paper, we focus on determining the Gowers <math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math> norm of one family of power permutations, thereby assessing their resistance to quadratic approximation attacks. The family contains five classes of power permutations, which are <math><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></msup><mo>+</mo><mn>3</mn></mrow></msup></math> with even <math><mrow><mi>n</mi><mo>≥</mo><mn>4</mn></mrow></math>, <math><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>s</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>s</mi></mrow></msup><mo>+</mo><mn>1</mn></mrow></msup></math> with <math><mrow><mn>1</mn><mo>≤</mo><mi>s</mi><mo>≤</mo><mrow><mo>⌊</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌋</mo></mrow></mrow></math> and <math><mrow><mi>n</mi><mo>≥</mo><mn>3</mn></mrow></math>, <math><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn></mrow></msup></math> with <math><mrow><mi>n</mi><mo>≥</mo><mn>3</mn></mrow></math>, <math><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></msup><mo>+</mo><mn>1</mn></mrow></msup></math> with even <math><mrow><mi>n</mi><mo>≥</mo><mn>4</mn></mrow></math>, and <math><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mfrac><mrow><mi>n</mi><mo>−<

引用次数: 0

On almost bipartite non-König–Egerváry graphs

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics

Pub Date : 2025-01-23 DOI: 10.1016/j.dam.2025.01.022

Vadim E. Levit , Eugen Mandrescu

<div><div>A set <math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi></mrow></math> is independent in a graph <math><mrow><mi>G</mi><mo>=</mo><mfenced><mrow><mi>V</mi><mo>,</mo><mi>E</mi></mrow></mfenced></mrow></math> if no two vertices from <math><mi>S</mi></math> are adjacent. The independence number <math><mrow><mi>α</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> is the cardinality of a maximum independent set, while <math><mrow><mi>μ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> is the size of a maximum matching in <math><mi>G</mi></math>. If <math><mrow><mi>α</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>+</mo><mi>μ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> equals the order of <math><mi>G</mi></math>, then <math><mi>G</mi></math> is a König–Egerváry graph (Deming, 1979; Gavril, 1977; Sterboul, 1979). The number <math><mrow><mi>d</mi><mfenced><mrow><mi>G</mi></mrow></mfenced><mo>=</mo><mo>max</mo><mrow><mo>{</mo><mfenced><mrow><mi>A</mi></mrow></mfenced><mo>−</mo><mfenced><mrow><mi>N</mi><mfenced><mrow><mi>A</mi></mrow></mfenced></mrow></mfenced><mo>:</mo><mi>A</mi><mo>⊆</mo><mi>V</mi><mo>}</mo></mrow></mrow></math> is the critical difference of <math><mi>G</mi></math> (Zhang, 1990) (where <math><mrow><mi>N</mi><mfenced><mrow><mi>A</mi></mrow></mfenced><mo>=</mo><mfenced><mrow><mi>v</mi><mo>:</mo><mi>v</mi><mo>∈</mo><mi>V</mi><mo>,</mo><mi>N</mi><mfenced><mrow><mi>v</mi></mrow></mfenced><mo>∩</mo><mi>A</mi><mo>≠</mo><mo>0̸</mo></mrow></mfenced></mrow></math>). It is known that the inequality <math><mrow><mi>α</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>−</mo><mi>μ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mi>d</mi><mfenced><mrow><mi>G</mi></mrow></mfenced></mrow></math> holds for every graph (Levit and Mandrescu, 2012; Lorentzen, 1966; Schrijver, 2003).</div><div>A graph <math><mi>G</mi></math> is (i) unicyclic if it has a unique cycle, (ii) almost bipartite if it has only one odd cycle. Let <math><mrow><mi>ker</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mo>⋂</mo><mrow><mo>{</mo><mi>S</mi><mo>:</mo><mi>S</mi></mrow></mrow></math> is a critical independent set of <math><mrow><mi>G</mi><mo>}</mo></mrow></math>, core<math><mfenced><mrow><mi>G</mi></mrow></mfenced></math> be the intersection of all maximum independent sets, and corona<math><mfenced><mrow><mi>G</mi></mrow></mfenced></math> be the union of all maximum independent sets of <math><mi>G</mi></math>. It is known that <math><mrow><mi>ker</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>⊆</mo><mi>core</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math> for every graph (Levit and

引用次数: 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.

﹀