Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph T (G) has the triangles of the graph G as its vertices, two of these being adjacent whenever as triangles in G they share an edge. A graph is edge-triangular if every edge is in at least one triangle. ...

Learning graph-structured data with graph neural networks (GNNs) has been recently emerging as an important field because of its wide applicability in bioinformatics, chemoinformatics, social network analysis, and mining. Recent GNN algorithms are based on message passing, which enables GNNs to integrate local structures node features recursively. However, past 1-hop neighborhood passing expose...

Graph embeddings have become a key paradigm to learn node representations and facilitate downstream graph analysis tasks. Many real-world scenarios such as online social networks communication involve streaming graphs, where edges connecting nodes are continuously received in manner, making the underlying structures evolve over time. Such raises great challenges for embedding techniques not onl...

A considerable amount of recent research has been conducted on the link-prediction problem, that is the problem of accurately predicting edges that will be established between actors of a social network in a future time period [LNK07, LZ10]. In cooperation with the provider of a German social network site (SNS), we aim to contribute to this line of research by analyzing the link-formation and i...

We study the neighborhood polynomial and complexity of its computation for chordal graphs. The a graph is generating function subsets vertices that have common neighbor. introduce parameter graphs called anchor width an algorithm to compute which runs in time if polynomially bounded. maximal number different sub-cliques clique appear as neighborhood. Furthermore we some subclasses such comparab...

Seymour’s Second Neighborhood Conjecture asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. We introduce the generalized comb, characterize them and prove that every oriented graph missing it satisfies this conjecture.