Related papers: A Generalisation of Interlinked Cycle Structures a…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
The {Congested Clique} is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an $n$-vertex graph in which any pair of vertices can…
Being motivated in terms of mathematical concepts from the theory of electrical networks, Klein & Ivanciuc introduced and studied a new graph-theoretic cyclicity index--the global cyclicity index (Graph cyclicity, excess conductance, and…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected…
A cycle cover of a graph is a collection of cycles such that each edge of the graph is contained in at least one of the cycles. The length of a cycle cover is the sum of all cycle lengths in the cover. We prove that every bridgeless cubic…
Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time $O((n+m)\alpha(n+m))$ where $n$ is the number of vertices, $m$ is the number of…
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…
Power-type graphs, such as the power graph, the directed power graph, the enhanced power graph and the difference graph, encode significant information about the internal structure of a finite group. Despite substantial investigation in…
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Hence, the task is formalized as maximum common subgraph…
K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using…
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants of an underlying block code into a number of components, and then coupling copies of these components together. By connecting (coupling) several SC…
Given a graph $G$ whose edges are labeled by ideals of a commutative ring $R$ with identity, a generalized spline is a vertex labeling of $G$ by the elements of $R$ so that the difference of labels on adjacent vertices is an element of the…
We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while a decentralized setting means there is…
Let $L$ be a set of positive integers. We call a (directed) graph $G$ an $L$\emph{-cycle graph} if all cycle lengths in $G$ belong to $L$. Let $c(L,n)$ be the maximum number of cycles possible in an $n$-vertex $L$-cycle graph (we use…
Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping…
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph…
Circular-arc graphs are the intersection graphs of arcs of a circle. The main result of this work describes the structure of all \emph{normalized intersection models} of circular-arc graphs. Normalized models of a circular-arc graph reflect…