The differential on graph operator R(<i>G</i>)

Let G = ( V ( G ), E ( G )) be a simple graph with vertex set V ( G ) and edge set E ( G ). Let S be a subset of V ( G ), and let B ( S ) be the set of neighbours of S in V ( G ) ∖S . The differential ∂ ( S ) of S is the number |B ( S ) |−|S| . The maximum value of ∂ ( S ) taken over all subsets S ⊆ V ( G ) is the differential ∂ ( G ) of G . The graph R( G ) is defined as the graph obtained from G by adding a new vertex v e for each e ∈ E ( G ), and by joining v e to the end vertices of e . In this paper we study the relationship between ∂ ( G ) and ∂ (R( G )), and give tight asymptotic bounds for ∂ (R( G )). We also exhibit some relationships between certain vertex sets of G and R( G ) which involve well known graph theoretical parameters.

Authors

Publication Details

Journal
RAIRO. Operations research
Published
2024-11-01
DOI
https://doi.org/10.1051/ro/2024212
Citations
2
Primary Topic
advanced mathematical theories
Type
article
Field-Weighted Citation Impact
1.78
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The differential on graph operator R(G)

Jesús Leaños Macías, Ludwin A. Basilio, Omar Rosario, José María Sigarreta Almira
2 citations
RAIRO. Operations research
advanced mathematical theories
1.78
article

The differential on graph operator R(G)

Jesús Leaños Macías, Ludwin A. Basilio, Omar Rosario, José María Sigarreta Almira
article en
2 citations

Abstract

Let G = ( V ( G ), E ( G )) be a simple graph with vertex set V ( G ) and edge set E ( G ). Let S be a subset of V ( G ), and let B ( S ) be the set of neighbours of S in V ( G ) ∖S . The differential ∂ ( S ) of S is the number |B ( S ) |−|S| . The maximum value of ∂ ( S ) taken over all subsets S ⊆ V ( G ) is the differential ∂ ( G ) of G . The graph R( G ) is defined as the graph obtained from G by adding a new vertex v e for each e ∈ E ( G ), and by joining v e to the end vertices of e . In this paper we study the relationship between ∂ ( G ) and ∂ (R( G )), and give tight asymptotic bounds for ∂ (R( G )). We also exhibit some relationships between certain vertex sets of G and R( G ) which involve well known graph theoretical parameters.

RAIRO. Operations researchVol. 58(6)
Openalex Percentile: Top 16%
advanced mathematical theories
1.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.