Abstract: Finding patterns in graphs is a fundamental problem in graph theory, and also a practical challenge during the analysis of big data sets. Inexact patterns may correspond to a set of possible ...

1. Introduction Graphs have become increasingly important in modeling complicated structures, such as chemical compounds, bimolecular structures, social networks, aviation maps, and the Web. Recent ...

This thesis project introduces a clustering method using the heat and wave equations along with eigenvalues and eigenvectors. This approach is capable of clustering graphs into two partitions with a ...

The problem is more interesting and challenging in a single-graph setup, in which the frequent patterns are to be found in only one graph that often consists of a large number of vertices and edges.

Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...

The project is a pattern matching tool in the domain of graphs. Graph A is considered a pattern in graph B, when A is a (optionally induced) subgraph, minor, or topological minor of B. Besides being ...

Business School, Shanghai Dianji University, Shanghai, China. Anderson gave a sufficient condition for the existence of 1-factors. Woodall showed the relationship of the binding number and the ...