Related papers: Existence of three solutions for a poly-Laplacian …

Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…

In the present paper we study the existence of solutions for some classes of singular systems involving the p(x) and q(x) Laplacian operators. The approach is based on bifurcation theory and subsupersolution method for systems of…

In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

We prove existence, multiplicity, and bifurcation results for $p$-Laplacian problems involving critical Hardy-Sobolev exponents. Our results are mainly for the case $\lambda \ge \lambda_1$ and extend results in the literature for $0 <…

We show Laplacian algebras are maximal, and give applications to the Classical Invariant Theory of real orthogonal representations of compact groups, including: The solution of the Inverse Invariant Theory problem for finite groups. An…

This paper is devoted to the existence and non-existence of positive solutions for a $(p, q)$-Laplacian system with indefinite nonlinearity depending on two parameters $(\lambda,\mu)$. By using the sub-supersolution method together with…

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

We obtain nontrivial solutions of a critical $(p,q)$-Laplacian problem in a bounded domain. In addition to the usual difficulty of the loss of compactness associated with problems involving critical Sobolev exponents, this problem lacks a…

We prove the existence of $N$ distinct pairs of nontrivial solutions for critical $p$-Laplacian problems in ${\mathbb R}^N$, as well as in bounded domains. To overcome the difficulties arising from the lack of compactness, we use a recent…

Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…

The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…

We are concerned with semilinear parabolic equations, with a time-dependent source term of the form $h(t)u^q$ with $q>1$, posed on an infinite graph. We assume that the bottom of the $L^2$-spectrum of the Laplacian on the graph, denoted by…

Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.

In this paper, we investigate the existence of multiple periodic solutions for two classes of nonlinear difference systems involving $(\phi_1,\phi_2)$-Laplacian. First, by using an important critical point theorem due to B. Ricceri, we…

We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and…

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Let $\mathscr G:= (V,E)$ be a weighted locally finite graph whose finite measure $\mu$ has a positive lower bound. Motivated by wide interest in the current literature, in this paper we study the existence of classical solutions for a class…

Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…

Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…