CORR

2012

Springer

12 years 3 months ago
2012

Springer

The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been eﬀectively used in the analysis of und...

ICDAR

2011

IEEE

12 years 7 months ago
2011

IEEE

—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...

PAKDD

2011

ACM

12 years 10 months ago
2011

ACM

Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...

CPC

2002

13 years 7 months ago
2002

Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...

CORR

2004

Springer

13 years 7 months ago
2004

Springer

A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...

COMBINATORICS

2004

13 years 7 months ago
2004

It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...

JCT

2007

13 years 7 months ago
2007

We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...

EJC

2007

13 years 7 months ago
2007

We examine the binary codes obtained from the row span over the ﬁeld F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...

COMBINATORICS

2007

13 years 7 months ago
2007

Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...

COMBINATORICS

2007

13 years 7 months ago
2007

Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and ﬁnite di...