Childhood constipation is a prevalent issue globally. Certain children experience persistent constipation and soiling, either as a result of surgical repair of anorectal malformations or underlying medical conditions that present management challenges. These refractory cases of constipation significantly affect the psychological well-being of both patients and their families. The available treatment options for refractory constipation are not clearly established. However, prompt and appropriate management of constipation contributes to an enhanced health-related quality of life. This article explores the current modalities available for treating children with challenging constipation and examines their impact on health-related quality of life.

Using coalescence and cones, this study defines three types of graphs formed by amalgamating vertices of disjoint unions of complete graphs. The three types include the cone over a disjoint union of two complete graphs (C1), the cone over a disjoint union of \(k\) complete graphs (C2), and the \(l\) cone over a disjoint union of two complete graphs (C3). Coalescence of complete graphs (C1, C3) and the \(l\) cone (C3) are determined by their Laplacian spectra, a novel finding. Their Laplacian spectra reveal the size of the vertex cutset. Applications include the analysis of corporate networks, where individuals form coalescence of complete graphs through joint membership of two or more company boards.

A famous conjecture of Ryser states that any \(r\)-partite set system has transversal number at most \(r-1\) times their matching number. This conjecture is only known to be true for \(r\leq3\) in general, for \(r\leq5\) if the set system is intersecting, and for \(r\leq9\) if the set system is intersecting and linear. In this note, we deal with Ryser’s conjecture for intersecting \(r\)-partite linear systems: if \(\tau\) is the transversal number for an intersecting \(r\)-partite linear system, then \(\tau\leq r-1\). If this conjecture is true, this is known to be sharp for \(r\) for which there exists a projective plane of order \(r-1\). There has also been considerable effort to find intersecting \(r\)-partite set systems whose transversal number is \(r-1\). In this note, we prove that if \(r\geq2\) is an even integer, then \(f_l(r)\geq3r-5\), where \(f_l(r)\) is the minimum number of lines of an intersecting \(r\)-partite linear system whose transversal number is \(r-1\). Aharoni \emph{et al.,} [R. Aharoni, J. Barát and I.M. Wanless, \emph{Multipartite hypergraphs achieving equality in Ryser’s conjecture}, Graphs Combin. {\bf 32}, 1–15 (2016)] gave an asymptotic lower bound: \(f_l(r)\geq3\).\(052r+O(1)\) as \(r\to\infty\). For some small values of \(r\) (\(r\geq2\) an even integer), our lower bound is better. Also, we prove that any \(r\)-partite linear system satisfies \(\tau\leq r-1\) if \(\nu_2\leq r\) for all \(r\geq3\) odd integer and \(\nu_2\leq r-2\) for all \(r\geq4\) even integer, where \(\nu_2\) is the maximum cardinality of a subset of lines \(R\subseteq\mathcal{L}\) such that any three elements chosen in \(R\) do not have a common point.

The vertex-degree based (VDB) topological index (or graphical function-index) \(TI_{f}(G)\) of \(G\) with edge-weight function \(f(x,y)\) was defined as \(TI_{f}(G)=\sum\limits_{uv\in E(G)}f(d(u),d(v))\), where \(d(u)\) is the degree of vertex \(u\) in \(G\). In this paper, we use a unified way to determine the extremal values of VDB indices of connected \((n,m)\)-graphs. When \(f(x,y)\) satisfies some special properties, we determine the connected \((n,m)\)-graphs with maximum (or minimum) \(TI_{f}(G)\) is the almost regular graphs. Our results generalize the results of paper [Aashtab, A., Akbari, S., Madadinia, S., Noei, M., \& Salehi, F. (2022) On the graphs with minimum Sombor index. MATCH Commun. Math. Comput. Chem., {88}, 553-559].

For all positive even integers \(n\), graphs of order \(n\) with degree sequence \(S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1\) naturally arose in the study of a labeling problem in [1].This fact motivated the authors of the aforementioned paper to study these sequences and as a result of this study they proved that there is a unique graph of order \(n\) realizing \(S_{n}\) for every even integer \(n\). The main goal of this paper is to generalize this result.

The Sombor index has gained lot of attention in the recent days for its mathematical properties and chemical applicabilities. Here, we initiated the novel block number version of the classical Sombor index and its matrix representation of a graph. The Block Sombor index \(BS(G)\) is defined as the sum total of square root of the sum of squares of block numbers of adjacent vertices, where the block number of a vertex is the number of blocks to which that vertex belongs to. The main purpose of this paper is to obtain some bounds and characterizations of \(BS(G)\) and its Block Sombor energy \(E_{BS}\). Also, we estimate some properties of spectral radius of Block Sombor matrix \(A_{BS}(G)\).

This study aims to model the statistical behaviour of extreme maximum temperature values in Rwanda. To achieve such an objective, the daily temperature data from January 2000 to December 2017 recorded at nine weather stations collected from the Rwanda Meteorological Agency were used. The two methods, namely the block maxima (BM) method and the Peaks Over Threshold (POT), were applied to model and analyse extreme temperatures in Rwanda. Model parameters were estimated, while the extreme temperature return periods and confidence intervals were predicted. The model fit suggests that Gumbel and Beta distributions are the most appropriate for the annual maximum daily temperature. Furthermore, the results show that the temperature will continue to increase as estimated return levels show it.

Using the Kudryashov and Tanh methods, we have obtained novel exact solutions for the Paraxial Wave Dynamical Equation with Kerr law, including various types of wave solutions. These distinct types of wave solutions have important applications in physics and engineering, and their physical characteristics are well defined. These outcomes are a substantial innovation in the study of water waves in mathematical physics and engineering phenomena. The results we have acquired demonstrate the power and effectiveness of the present techniques.

In this work, the effect of suction/injection on transient free convective flow in vertical porous (suction/injection on the channel surfaces) channel filled with porous material in the presence of thermal dispersion was studied. The Boussinesq assumption is applied and the nonlinear governing equations of motion and energy are developed. The time dependent problem is solved using implicit finite difference method while steady state problem is solved by perturbation technique method. The solution obtained is graphically represented and the effects of suction/injection, time, Darcy number, thermal dispersion, and Prandtl number on the fluid flow and heat transfer characteristics. During the course of computation, an excellent agreement was found between the well-known steady state solutions sand transient solutions at large value of time. Furthermore, the time required to reach steady state velocity and temperature field strongly dependent on suction/injection parameter, Prandtl number and thermal dispersion parameter. The introduction of suction/injection has distorted the symmetric nature of the flow formation.

In this paper we establish the existence of monads on cartesian products of projective spaces. We give the necessary and sufficient conditions for the existence of monads on \(\mathbf{P}^1\times\cdots\times \mathbf{P}^1\). We construct vector bundles associated to monads on \(X=\mathbf{P}^n\times\mathbf{P}^n\times\mathbf{P}^m\times\mathbf{P}^m\). We study these vector bundles associated to monads on \(X\) and prove their stability and simplicity.