A small-world Farey graph is a recursively constructed graph characterized as a small-world network graph. Many of the network properties of this graph has been studied. In this paper, we take a combinatorial approach to investigate the rainbow vertex connectivity of the small-world Farey graph. A graph is rainbow vertex-connected when there exists a path, in which all of its internal vertices have distinct colors, between each pair of vertices. We give a coloring so that the graph is rainbow vertex-connected. The rainbow vertex-connection number of the small-world Farey graph, which is the minimum number of colors needed so that the graph is rainbow vertex-connected, is one less than the diameter of the graph.
This study examines the δ-complements of graphs—a specific type of graph complement whose adjacency depends on the adjacency of the vertices with identical degrees in the original graph. More specifically, we study this type of complement regarding the domination number. We provide sharp Nordhaus-Gaddum-type bounds on the domination number of a graph and its δ-complement. We also provide sharp bounds on the domination numbers of the δ-complements of joined graphs and Cartesian product graphs.
We formulate and analyze a new finite difference scheme for a shallow water model in the form of viscous Burgers-Poisson system with periodic boundary conditions. The proposed scheme belongs to a family of three-level linearized finite difference methods. It is proved to preserve both momentum and energy in the discrete sense. In addition, we proved that the method converges uniformly and has second order of accuracy in space. The analysis given in this work is the first time a pointwise error estimation is done on a second-order finite difference operator applied to the Burgers-Poisson system. We validate our findings by performing various numerical simulations on both viscous and inviscous problems. These numerical examples show the efficacy of the proposed method and confirm the proven theoretical results.
This study examines the -complements of graphs—a specific type of graph complement whose adjacency depends on the adjacency of the vertices with identical degrees in the original graph. More specifically, we study this type of complement regarding the domination number. We provide sharp Nordhaus–Gaddum-type bounds on the domination number of a graph and its -complement. We also provide sharp bounds on the domination numbers of the -complements of joined graphs and Cartesian product graphs.