Related papers: The complexity of L(p,q)-Edge-Labelling
Given a non-negative integer $q$, we study two different notions of the $q$-capability of Lie algebras via the non-abelian $q$-exterior product of Lie algebras. The first is related to the $q$-crossed modules and inner $q$-derivations, and…
We consider the problem of computing $\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\ell$ that avoid the nesting of edges on any of the pages. Inspired…
We prove some existence and nonexistence results for a class of critical $(p,q)$-Laplacian problems in a bounded domain. Our results extend and complement those in the literature for model cases.
Let $p,q$ be functions on $\mathbb{R}^{N}$ satisfying $1\ll q\ll p\ll N$, we consider $p(x)$-Laplacian problems of the form \[ \left\{ \begin{array} [c]{l}% -\Delta_{p(x)}u+V(x)\vert u\vert ^{p(x)-2}u=\lambda\vert u\vert…
A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and product of edge multiplicities in an (s,q)-graph on n vertices.…
We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols of the language L and two special vertices s and t, test if…
In this paper we prove the existence of infinitely many nontrivial solutions for the class of $(p,\, q)$ fractional elliptic equations involving concave-critical nonlinearities in bounded domains in $\mathbb{R}^N$. Further, when the…
In this paper, we deal with the following $(p,q)$-fractional problem $$ (-\Delta)^{s_{1}}_{p}u +(-\Delta)^{s_{2}}_{q}u=\lambda P(x)|u|^{k-2}u+\theta|u|^{p_{s_{1}}^{*}-2}u \, \mbox{ in }\, \Omega,\qquad u=0\, \mbox{ in }\, \mathbb{R}^{N}…
An $(n,s,q)$-graph is an $n$-vertex multigraph in which every $s$-set of vertices spans at most $q$ edges. Erd\H{o}s initiated the study of maximum number of edges of $(n,s,q)$-graphs, and the extremal problem on multigraphs has been…
For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. $H$-free Edge Completion and $H$-free Edge Editing…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…
We analyze a non-linear elliptic boundary value problem, that involves $(p, q)$ Laplace operator, for the existence of its positive solution in an arbitrary smooth bounded domain. The non-linearity here is driven by a continuous function in…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…
We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph…
We prove existence and regularity results for weak solutions of non linear elliptic systems with non variational structure satisfying $(p,q)$-growth conditions. In particular we are able to prove higher differentiability results under a…
In this paper we study the graded version of Naimark's problem for Leavitt path algebras considering them as $\mathbb{Z}$-graded algebras. Several characterizations are obtained of a Leavitt path algebra $L$ of an arbitrary graph $E$ over a…
We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction…
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…