Related papers: Skolem Circles
Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
In this survey article, we review some conceptual approaches to the cyclic category $\Lambda$, as well as its description as a crossed simplicial group. We then give a new proof of the model structure on cyclic sets, work through the…
We show that the problem of identifying different signal components from a time-frequency representation can be equivalently phrased as a graph clustering problem: given a graph $G=(V,E)$ one aims to identify `clusters', subgraphs that are…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
In this paper, some subclasses of block graphs are considered in order to analyze Fiedler vector of its members. Two families of block graphs with cliques of fixed size, the block-path and block-starlike graphs, are introduced. Cases A and…
We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…
We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…
We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
Frames for Hilbert spaces are interesting for mathematicians but also important for applications e.g. in signal analysis and in physics. Both in mathematics and physics it is natural to consider a full scale of spaces, and not only a single…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic…
Interpreting a node-link graph is enhanced if similar subgraphs (or motifs) are depicted in a similar manner; that is, they have the same visual form. Small motifs within graphs may be perceived to be identical when they are structurally…
Graph machine learning has been extensively studied in both academia and industry. However, in the literature, most existing graph machine learning models are designed to conduct training with data samples in a random order, which may…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs.