In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are una...

we give a new recursive method to compute the number of cliques and cycles of a graph. this method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. in particular, let $g$ be a graph and let $overline {g}$ be its complement, then given the chromatic polynomial of...

abstract: in this study an appropriate computational approach was presented for estimating the boiling temperatures of 41 different types of olefins and their derivatives. based on the guidelines of this approach, several structural indices related to the organic components were applied using graph theory. meanwhile, in addition to evaluating the relation between the boiling temperatures of ole...

A graph containing some edges with probability measures and other uncertain is referred to as an random graph. Numerous real-world problems in social networks transportation can be boiled down optimization graphs. Actually, information graphs always asymmetric. Regularization a common problem theory, the regularity index fundamentally measurable indicator of Therefore, this paper investigates w...