This report briefly describes the development and applications of net-sign graph theory. The current work enunciates the graph (molecule) signature of nonalternant non-benzenoid hydrocarbons with odd member of rings (non-bipartite molecular graphs) based on chemical signed graph theory. Experimental evidences and Hückel spectrum reveal that structure possessing nonbonding molecular orbital (NBM...

A foodshed is a geographic area from which a population derives its food supply, but a method to determine boundaries of foodsheds has not been formalized. Drawing on the food–water–energy nexus, we propose a formal network science definition of foodsheds by using data from virtual water flows, i.e., water that is virtually embedded in food. In particular, we use spectral graph partitioning for...

Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...

Running head: Exponential Approximation by Exchangeable Pairs Version of 4/7/06 By Sourav Chatterjee and Jason Fulman Abstract: A general Berry-Esseen bound is obtained for the exponential distribution using Stein’s method of exchangeable pairs. As an application, an error term is derived for Hora’s result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential limit. This is...

With every graph (or digraph) one can associate several different matrices. Here we shall concentrate mainly on the adjacency matrix of (undirected) graphs, and also discuss briefly the Laplacian. We shall show that spectral properties (the eigenvalues and eigenvectors) of these matrices provide useful information about the structure of the graph. It turns out that for regular graphs, the infor...

Foreword These notes are a lightly edited revision of notes written for the course " Graph Partitioning and Expanders " offered at Stanford in Winter 2011 and Winter 2013. I wish to thank the students who attended this course for their enthusiasm and hard work. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily re...

Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...

We present an interactive toolbox application we have developed to enable users to gain an intuitive understanding of the “meaning” of eigenvalues and eigenvectors of graph-related matrices. In addition, we explore spectral embeddings and the effects of graph altering algorithms on the eigenvalues of a graph. Furthermore, we examine Luby’s fast distributed randomized algorithm for finding a max...

We investigate conditions on a graph C∗-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth (1,∞)-summable semfinite spectral triple. The local index theorem allows us to compute the pairing with K-theory. This produces invariants in the K-theory of the fixed point algebra, and these ...

This note is a write up of a talk given at the ILAS meeting in Braunschweig, 2011, at the minisymposium celebrating the 80th birthday of Miroslav Fiedler. The purpose of the talk is to outline the impact of Fiedler’s work on the development of spectral graph theory. Fiedler is best known for putting forward the algebraic connectivity and its eigenvector. These two topics were genuine gold strik...