[PDF] Top 20 Upper bounds on the Laplacian spread of graphs

... two upper bounds for the Laplacian spread of connected ...In the next section, using a theorem due to Brauer we obtain a new matrix whose matricial spread coincides ... See full document

... in the following way. In Section 2 a lower bound for the signless Laplacian index of graphs with at least one (κ, τ)-regular set is deduced under different suitable ...illustrate ... See full document

... one of the most intriguing aspects of quantum theory which reveals that nature is intrinsically different than our classical view of the ...One of the main goals in ... See full document

... concerning the spread of the line and the total graph of a given ...for the spread of a unicyclic graph with an odd girth to be at most the ... See full document

... is of theoretical and practical significance to probe mathematical tools tailored for evolving ...paper, on top of the dynamic Estrada index, we study the dynamic Laplacian ... See full document

... problem of finding a minimum longest path transversal remains open for several well-studied graph ...permutation graphs admit a transversal of cardinality ...vex graphs and connected ... See full document

... distance Laplacian-energy like of a graph and we derive sharp lower bounds on these two distance energies among all the connected graphs of prescribed order in terms ... See full document

... In the case of the Laplacian and normalized Laplacian matrices, the smallest eigenvalue is always equal to ...In the case of the Randi´ c matrix, the ... See full document

... list of questions and open problems. In [9], among other results, the characterizations of graphs G whose complementary prisms attain lower bounds on domination and total domina- ... See full document

... procedure of elimination of subproblems, and solving a selected active ...For the subproblems elimination procedure, the algorithm uses and updates, at each iteration, two matrices, one ... See full document

... as the Randi´ c index. In fact, the summands on the right hand side of (1) may be understood as matrix ...spite of its connection with Randi´ c index this matrix seems to have ... See full document

... degree of u. The smallest and largest vertex degree of G are denoted by δ(G) and ∆(G), ...k. The complement of a graph G is denoted by G. A set of vertices that induces a ... See full document

... aim of this paper is to establish a new and improved upper bound for the Laplacian energy of graphs whose Laplacian characteristic polynomial can be decomposed as a ... See full document

... spaces of generalised smoothness have been studied by many authors, by differ- ent approaches and considering different degrees of ...modulus of continuity, and to Kalyabin for an approach using ... See full document

... at the V Hungar- ian Colloquium on Combinatorics, Keszthelly ...in the paper [3] published in the proceedings of this ...summary of results of [2]. Almost the whole ... See full document

... lack of entrance control in diverse sections, ...where the security level increased since the terrorist attack on 11 th September 2011 at the former World Trade Center in New York City ... See full document

... from the LANL ( ...from the original publications (Afonso et ...city of sampling were excluded from the analyses. The resulting datasets had 564 C2V3 and 354 pol ...sequences. ... See full document

... picture of the company’s “financial health” or Corporate Social ...when the choice of the variables to be displayed on graphs depends on the company’s ... See full document

... to the translation invariance of the problem we can always assume that every connected components are ...since the number of unknowns is small (the number of expected ... See full document

... been of great interest to mathematicians for almost 50 ...defined the Selberg zeta function, by analogy with the Riemann zeta function, to be a product over prime geodesics in a compact Riemann ... See full document