scholarly journals Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

2022 ◽  
Vol 345 (3) ◽  
pp. 112706
Author(s):  
A. Abiad ◽  
G. Coutinho ◽  
M.A. Fiol ◽  
B.D. Nogueira ◽  
S. Zeijlemaker
Author(s):  
Albert William ◽  
Roy Santiago ◽  
Indra Rajasingh

Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.


2021 ◽  
Vol 1836 (1) ◽  
pp. 012026
Author(s):  
M Y Rohmatulloh ◽  
Slamin ◽  
A I Kristiana ◽  
Dafik ◽  
R Alfarisi

Author(s):  
Piero D’Ancona ◽  
Luca Fanelli ◽  
Nico Michele Schiavone

AbstractWe prove that the eigenvalues of the n-dimensional massive Dirac operator $${\mathscr {D}}_0 + V$$ D 0 + V , $$n\ge 2$$ n ≥ 2 , perturbed by a potential V, possibly non-Hermitian, are contained in the union of two disjoint disks of the complex plane, provided V is sufficiently small with respect to the mixed norms $$L^1_{x_j} L^\infty _{{\widehat{x}}_j}$$ L x j 1 L x ^ j ∞ , for $$j\in \{1,\dots ,n\}$$ j ∈ { 1 , ⋯ , n } . In the massless case, we prove instead that the discrete spectrum is empty under the same smallness assumption on V, and in particular the spectrum coincides with the spectrum of the unperturbed operator: $$\sigma ({\mathscr {D}}_0+V)=\sigma ({\mathscr {D}}_0)={\mathbb {R}}$$ σ ( D 0 + V ) = σ ( D 0 ) = R . The main tools used are an abstract version of the Birman–Schwinger principle, which allows in particular to control embedded eigenvalues, and suitable resolvent estimates for the Schrödinger operator.


Sign in / Sign up

Export Citation Format

Share Document