Let H = { H v : v ∈ V ( G )} be a family of nonempty graphs indexed by the vertex set of a graph G . The corona graph G H of G and H is the disjoint union of G and H v , v ∈ V ( G ), with additional ...

Abstract: Counting the number of independent sets of a graph G (denoted as NI(G)) is a classical #P-complete problem for graphs of degree greater or equal than 3. However, there are classes of graphs ...

ABSTRACT: Pattern recognition is a task of searching particular patterns or features in the given input. The data mining, computer networks, genetic engineering, chemical structure analysis, web ...

Abstract: We investigate graph convolution networks with efficient learning from higher-order graph convolutions and direct learning from adjacency matrices for node classification. We revisit the ...

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.