Subexponential algorithm for d-cluster edge deletion: Exception or rule?

2020 ◽  
Vol 113 ◽  
pp. 150-162
Author(s):  
Neeldhara Misra ◽  
Fahad Panolan ◽  
Saket Saurabh
2021 ◽  
Vol 68 (2) ◽  
pp. 1-38
Author(s):  
Marthe Bonamy ◽  
Édouard Bonnet ◽  
Nicolas Bousquet ◽  
Pierre Charbit ◽  
Panos Giannopoulos ◽  
...  

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

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

Author(s):  
Modjtaba Ghorbani ◽  
Mardjan Hakimi-Nezhaad ◽  
Lihua Feng

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.


2015 ◽  
Vol 29 ◽  
pp. 59-73
Author(s):  
Wen-Huan Wang ◽  
Wasin So

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