[PDF] Top 20 Un lenguaje común para una política de inmigración y asilo en la Unión Europea

... The Nordhaus–Gaddum Problem is to determine sharp bounds for ( ) + ( ) and ( ) · ( ), as ranges over the class of all graphs of order , and to characterize the extremal graphs, ...i.e., ... See full document

... The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected ...the Harary indices of the join, corona product, Cartesian product, composition and ... See full document

... The Harary index is constructed so as to take into account (in a rather rough manner) interactions between pairs of ...molecular graphs, these are pairs of carbon ...the Harary index, ... See full document

... of graphs for general sum–connectivity co–index. The Nordhaus–Gaddum–type results for the general sum–connectivity co–index is also considered and will be viewed in ... See full document

... AGPAT2, 1-acylglycerol-3-phosphate-o-acyltransferase2 (also known as lysophosphatidic acid acyltransferase, is a novel target for cancer therapy. There are several lysophosphatidic acid acyltransferase inhibitors. In ... See full document

... connected graphs with fixed number of vertices and cyclomatic number ...such graphs) are determined, whose −indices assume the smallest possible ...Zagreb index, ...relevant results as ... See full document

... Wiener Index of a generic chain-like polygonal systembegan from the late 1980’s [13, ...theWiener Index for such a chain was onceconsidered a very hard ...wiener index of pentachainsand Ivan Gutman ... See full document

... The idea to obtain the bounds for the four operations of the graphs for general sum-connectivity index of the graphs was proposed by MI. After several discussions, SA obtained some sharp bounds for ... See full document

... cyclotomic index of G is defined as  p ( )(mod ) q p and is denoted by ...cyclotomic index of some special type of ...cyclotomic index of certain ... See full document

... special type of polynomial associated to every ( , ) p q -graph ...of graphs and shall attempt to compute the adjacent degree index of some special type of ...degree index of certain ... See full document

... Randić index, first general Zagreb index, geometric arithmetic index, atom-bond connectivity index and general sum-connectivity index of the total graph of the tadpole graphs, ... See full document

... standard graphs G which are β M -excellent and not β M -excellent ...some results on β M -excellent graphs in the case of a Cartesian product, generalization of Petersen graph and ... See full document

... d 3 (u) influences the total ϕ-electron energy. But this remained unstudied by the researchers for a long time, except for a few occasions [12, 15, 16] until the publication of an article by Furtula and Gutman in 2015 ... See full document

... In this section , we will compute the Kirchhoff index of R k (G ) , G is regular, by using the results obtained in the previous section . Gutman and Mohar [4] and Zhu [12] proved the following relationship ... See full document

... Abstract:-In this paper an attempt is made to study about Fuzzy Topological Graph Theory and the trivial fuzzy topologies of the set of fuzzy graphs. The Suspension and Amalgamation of two fuzzy topological ... See full document

... Abstract. A topological representation of a molecule is called molecular graph. A molecular graph is a collection of points representing the atoms in the molecule and set of lines representing the covalent bonds. These ... See full document

... V ∪ , and two vertices are adjacent if and only if they are adjacent or incident in G . It is introduced by Behzad & Chartrand [5]. Several properties of total graphs are investigated in the literature (see ... See full document

... where m G k ( ; ) denotes the number of ways in which k pairwise independent edges are selected in G; k  2 , in addition m G ( ;0) 1  and m G ( ;1)  the number of edges of G. For a molecular graphG, the Hosoya ... See full document

... the Harary graph and hence prove that r admits antimagic total labeling as well as (a,d)-vertex antimagic total labeling where r > 0 and t > 0 are finite ... See full document

... The Shields-Harary numbers are a class of graph parameters that measure a certain kind of robustness of a graph, thought of as a network of fortified reservoirs, with reference to a given cost function. We prove a ... See full document