Additive Approximation for Edge-Deletion Problems (Abstract)

2006 ◽  
pp. 1-2
Author(s):  
Noga Alon ◽  
Asaf Shapira ◽  
Benny Sudakov
Keyword(s):  
Edge Deletion ◽  
Additive Approximation

scholarly journals Additive approximation for edge-deletion problems

2009 ◽  
Vol 170 (1) ◽  
pp. 371-411 ◽  
Author(s):  
Noga Alon ◽  
Asaf Shapira ◽  
Benny Sudakov
Keyword(s):  
Edge Deletion ◽  
Additive Approximation

An improved branching algorithm for the proper interval edge deletion problem

2021 ◽  
Vol 16 (2) ◽  
Author(s):  
Wenjun Li ◽  
Xiaojing Tang ◽  
Yongjie Yang
Keyword(s):  
Edge Deletion

scholarly journals Triangle edge deletion on planar glasses-free RGB-digraphs

2019 ◽  
Vol 788 ◽  
pp. 2-11 ◽  
Author(s):  
Dongjing Miao ◽  
Zhipeng Cai ◽  
Jiguo Yu ◽  
Yingshu Li
Keyword(s):  
Edge Deletion

scholarly journals Acknowledgement: edge deletion, singular values and ABC energy of graphs

2021 ◽  
Vol 87 (3) ◽  
pp. 745
Author(s):  
Modjtaba Ghorbani ◽  
Mardjan Hakimi-Nezhaad ◽  
Lihua Feng
Keyword(s):  
Singular Values ◽  
Edge Deletion

Following Estrada's method, as given in [1], Ghorbani et al. communicated in [2], and later also in [3], the following result on A-energy.

scholarly journals Graph energy change due to any single edge deletion

2015 ◽  
Vol 29 ◽  
pp. 59-73
Author(s):  
Wen-Huan Wang ◽  
Wasin So
Keyword(s):  
Partial Solution ◽  
Energy Change ◽  
Single Edge ◽  
Edge Deletion ◽  
Numerical Evidence ◽  
Graph Energy ◽  
The Absolute ◽  
Cycle Graph

The energy of a graph is the sum of the absolute values of its eigenvalues. We propose a new problem on graph energy change due to any single edge deletion. Then we survey the literature for existing partial solution of the problem, and mention a conjecture based on numerical evidence. Moreover, we prove in three different ways that the energy of a cycle graph decreases when an arbitrary edge is deleted except for the order of 4.

Sign in / Sign up

Export Citation Format

Share Document