We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
Barry Monson, Tomaz Pisanski, Egon Schulte, Asia I...
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...