Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777451 | European Journal of Combinatorics | 2017 | 12 Pages |
Abstract
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we extend the following four topics from (un)directed graphs to bidirected graphs:
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Laura Gellert, Raman Sanyal,