Related papers: Fractional Covers of Hypergraphs with Bounded Mult…
Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are…
The paper investigates solutions of the fractional hyperbolic diffusion equation in its most general form with two fractional derivatives of distinct orders. The solutions are given as spatial-temporal homogeneous and isotropic random…
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each…
A spanning tree $T$ of a connected graph $G$ is a subgraph of $G$ that is a tree covers all vertices of $G$. The leaf distance of $T$ is defined as the minimum of distances between any two leaves of $T$. A fractional matching of a graph $G$…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a graph is at most $k$ if it has a fractional coloring in…
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of…
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
Graph $G$ is $F$-saturated if $G$ contains no copy of graph $F$ but any edge added to $G$ produces at least one copy of $F$. One common variant of saturation is to remove the former restriction: $G$ is $F$-semi-saturated if any edge added…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
This article presents the construction of a non-affine hypersurface on an $n$-simplex in $\mathbb{R}^n$. Additionally, fractal dimension of the graph of a non-affine multivariate real-valued fractal function is estimated under certain…
A fractional colouring of a graph $G$ is a function that assigns a non-negative real value to all possible colour-classes of $G$ containing any vertex of $G$, such that the sum of these values is at least one for each vertex. The fractional…
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A…
The fractional versions of graph theoretic-invariants multiply the range of applications in scheduling, assignment and operational research problems. In this paper, we introduce the fractional version of local metric dimension of graphs.…