[PDF] Top 20 La noción de libertad como "causa sui" en Tomás de Aquino
Has 10000 "La noción de libertad como "causa sui" en Tomás de Aquino" found on our website. Below are the top 20 most common "La noción de libertad como "causa sui" en Tomás de Aquino".
Laplacian Sum-Eccentricity Energy of a Graph
... The distance d(u, v) between two vertices u and v in a (connected) graph G is the length of a shortest path connecting u and v [4]. The eccentricity of a vertex v ∈ V(G) is e(v) = max{d(u, v) : u ∈ V(G)}. ... See full document
46
Energy of graphs
... The energy E ( G ) of a graph G is equal to the sum of the absolute values of the graph eigenvalues, namely the sum of the eigenvalues of the adjacency matrix A ( G ) of ...π-electron ... See full document
50
A New Like Quantity Based on "Estrada Index"
... the sum of the chromatic numbers of a graph G and its complement ...of graph invariants in terms of G and G, and collected these studies in the literature under the name of “Nordhaus-Gaddum-type ... See full document
66
Note on the Sum of Powers of Normalized Signless Laplacian Eigenvalues of Graphs
... The graph energy concept was extended to energy of any matrix in the following manner ...the energy of the matrix M is defined as the sum of its singular values ... See full document
27
Vertex weighted Laplacian graph energy and other topological indices
... Let G be a connected graph. Given two vertices u and v in V ( G ) , the distance between u and v, denoted by d ( u, v ) = d G ( u, v ) , is the length of the shortest path connecting them. The Wiener index W ( G ) ... See full document
14
Laplacian Energy of a Fuzzy Graph
... Laplacian energy of a graph is equal to the sum of distances of the Laplacian eigenvalues of and the average degree () of ...The Laplacian energy () and the ordinary ... See full document
35
On Eccentricity Version of Laplacian Energy of a Graph
... of eccentricity version of Laplacian energy of a graph ...original Laplacian energy and eccentricity version of Laplacian energy, where as also have some ... See full document
81
On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph
... (10) Combining Eqs. (9) and (10) we get the result (8). Theorem 3.2. Let G be any graph with n vertices and let ∆ be the absolute value of the determinant of the eccentricity sum matrix ES(G). Then ... See full document
7
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
... bicyclic graph G is obtained from a basic bicyclic graph ∞(p, q, l) or θ (p, q, l) by attaching trees to some of its ...bicyclic graph G, we call its basic bicyclic graph ∞(p, q, l) or θ (p, ... See full document
129
The chromatic sum of a graph: history and recent developments
... Obviously, for every graph G , χ(G) ≤ col (G) . However, the inequality s(G) ≤ col (G) does not always hold. For example, for any tree T , col (T ) = 2 and, as we will see later, most trees have strength larger ... See full document
223
Introduction: big data and partial differential equations
... the sum of the edge weights corresponding to edges with one node in each set is ...the graph is bipartite, this corresponds to partitioning the node set according to the bipartite ...the graph ... See full document
29
Reciprocal Graphs
... In this paper, we construct some new classes of reciprocal graphs and an upperbound for their energy is obtained. Pairs of equienergetic reciprocal graphs on n ≡ 0 mod ( 12 ) and n ≡ 0 mod ( 16 ) are constructed. ... See full document
18
Survey of Graph Energies
... In our records, we have data on more than 60 different graph energies. In what follows, we give a list thereof, ordered according to the time of their first occurrence in the literature, with reference to the ... See full document
10
Sum Divisor Cordial Labeling of Herschel Graph
... a graph, we mean a finite undirected graph without loops or multiple ...to graph theory we refer to Harary [3] . A labeling of graph is a map that carries the graph elements to the set ... See full document
46
On Laplacian and Normalized Laplacian of a Social Network
... II. LAPLACIAN AND NORMALIZED LAPLACIAN To obtain the number of spanning trees of a graph through the evolution of the determinant of a matrix , we use Matrix-Tree ...connected graph that ... See full document
20
Using evolving interface techniques to solve network problems
... given graph, instead of on a continuum set Ω ⊂ R n and which serves as a graph counterpart of F ...undirected) graph, ω ij is a nonnegative weight on the edge between nodes i and j in the ... See full document
66
The Bounds for Eigenvalues of Normalized Laplacian Matrices and Signless Laplacian Matrices
... In this paper, we found extreme eigenvalues of normalized Laplacian matrix and signless Laplacian matrix of a G graph with using theirs traces... Conjugate transpose of A denoted by A∗.[r] ... See full document
135
Sum Divisor Cordial Labeling of Theta Graph
... Theta graph and some graph operations in Theta graph namely fusion, duplication, switching of a central vertex, path union of two copies and the star of ... See full document
64
A note on eccentric distance sum
... the sum of distances of all vertices in G from v . The eccentric distance sum was a novel distance-based molecular structure descriptor which can be used to predict biological and physical ... See full document
11
Bounds for the signless Laplacian energy of digraphs
... The energy connected to undirected graphs has been well investigated in the literature, see [1, 6, 7, 8, 10, 17] and a book ...The energy of an undirected graph has close links to ...the ... See full document
119
Related subjects