The signless Laplacian spectral radius of a graph is the largest eigenvalueof its signless Laplacian. In this paper, we prove that the graph $K_{2}ablaP_{n... G Yu 被引量: 1发表: 2014年 Spectral extrema of 1-planar graphs A graphGis called a 1-planar graph ifGhas a drawing in...
Spectral extrema of $K_{s,t}$-minor free graphs--On a conjecture of M. Tait In\nthis paper, Tait's conjecture is completely solved. We also determine the\nmaximum spectral radius and its extremal graphs for $n$-vertex $K_{1,t}$-minor\nfree graphs. To prove our results, some spe...
OEMT is based on external smoothing of T(λ) to account for the partial coherence of light in the film, double transformation of T(λ) to exclude the substrate absorption and utilization of a part of T(λ) providing the lowest fluctuation of estimates of d d¯ for the extrema of T(...