• Title/Summary/Keyword: infinite graph

Search Result 27, Processing Time 0.018 seconds

EXISTENCE OF GLOBAL SOLUTIONS TO SOME NONLINEAR EQUATIONS ON LOCALLY FINITE GRAPHS

  • Chang, Yanxun;Zhang, Xiaoxiao
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.703-722
    • /
    • 2021
  • Let G = (V, E) be a connected locally finite and weighted graph, ∆p be the p-th graph Laplacian. Consider the p-th nonlinear equation -∆pu + h|u|p-2u = f(x, u) on G, where p > 2, h, f satisfy certain assumptions. Grigor'yan-Lin-Yang [24] proved the existence of the solution to the above nonlinear equation in a bounded domain Ω ⊂ V. In this paper, we show that there exists a strictly positive solution on the infinite set V to the above nonlinear equation by modifying some conditions in [24]. To the m-order differential operator 𝓛m,p, we also prove the existence of the nontrivial solution to the analogous nonlinear equation.

ROUGH ISOMETRY AND THE SPACE OF BOUNDED ENERGY FINITE SOLUTIONS OF THE SCHRODINGER OPERATOR ON GRAPHS

  • Kim, Seok-Woo;Lee, Yong-Hah;Yoon, Joung-Hahn
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.4
    • /
    • pp.609-614
    • /
    • 2010
  • We prove that if graphs of bounded degree are roughly isometric to each other, then the spaces of bounded energy finite solutions of the Schr$\ddot{o}$dinger operator on the graphs are isomorphic to each other. This is a direct generalization of the results of Soardi [5] and of Lee [3].

REMARKS ON THE EXISTENCE OF AN INERTIAL MANIFOLD

  • Kwak, Minkyu;Sun, Xiuxiu
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1261-1277
    • /
    • 2021
  • An inertial manifold is often constructed as a graph of a function from low Fourier modes to high ones and one used to consider backward bounded (in time) solutions for that purpose. We here show that the proof of the uniqueness of such solutions is crucial in the existence theory of inertial manifolds. Avoiding contraction principle, we mainly apply the Arzela-Ascoli theorem and Laplace transform to prove their existence and uniqueness respectively. A non-self adjoint example is included, which is related to a differential system arising after Kwak transform for Navier-Stokes equations.

QUASI m-CAYLEY STRONGLY REGULAR GRAPHS

  • Kutnar, Klavdija;Malnic, Aleksander;Martinez, Luis;Marusic, Dragan
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.6
    • /
    • pp.1199-1211
    • /
    • 2013
  • We introduce a new class of graphs, called quasi $m$-Cayley graphs, having good symmetry properties, in the sense that they admit a group of automorphisms G that fixes a vertex of the graph and acts semiregularly on the other vertices. We determine when these graphs are strongly regular, and this leads us to define a new algebro-combinatorial structure, called quasi-partial difference family, or QPDF for short. We give several infinite families and sporadic examples of QPDFs. We also study several properties of QPDFs and determine, under several conditions, the form of the parameters of QPDFs when the group G is cyclic.

THE RANGE OF r-MAXIMUM INDEX OF GRAPHS

  • Choi, Jeong-Ok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.5
    • /
    • pp.1397-1404
    • /
    • 2018
  • For a connected graph G, an r-maximum edge-coloring is an edge-coloring f defined on E(G) such that at every vertex v with $d_G(v){\geq}r$ exactly r incident edges to v receive the maximum color. The r-maximum index $x^{\prime}_r(G)$ is the least number of required colors to have an r-maximum edge coloring of G. In this paper, we show how the r-maximum index is affected by adding an edge or a vertex. As a main result, we show that for each $r{\geq}3$ the r-maximum index function over the graphs admitting an r-maximum edge-coloring is unbounded and the range is the set of natural numbers. In other words, for each $r{\geq}3$ and $k{\geq}1$ there is a family of graphs G(r, k) with $x^{\prime}_r(G(r,k))=k$. Also, we construct a family of graphs not admitting an r-maximum edge-coloring with arbitrary maximum degrees: for any fixed $r{\geq}3$, there is an infinite family of graphs ${\mathcal{F}}_r=\{G_k:k{\geq}r+1\}$, where for each $k{\geq}r+1$ there is no r-maximum edge-coloring of $G_k$ and ${\Delta}(G_k)=k$.