Department of Mathematics Staff Publications
Browse by
Recent Submissions
-
The Gutman Index and the Edge-Wiener Index of Graphs with given Vertex-Connectivity
(University of Zielona Góra, 2015-12-30)The Gutman index and the edge-Wiener index have been extensively investigated particularly in the last decade. An important stream of re- search on graph indices is to bound indices in terms of the order and other parameters ... -
Application of citrus sinensis solid waste as a pseudo- catalyst for free cyanide conversion under alkaline conditions
(BioResources, 2013-05-08)In this study, Citrus sinensis (C. sinensis) solid waste was used to catalyze the conversion of free cyanide (F-CN) under alkaline conditions; conditions which represent most industrial wastewater containing F-CN. Acid ... -
Unsteady contact melting of a rectangular cross section material on a flat plate.
(American Institute of Physics, 2008-10-06)The work in this paper concerns a mathematical model of the contact melting process of a rectangular material in contact with a hot plate. The problem is described by a coupled system of heat equations in the solid and ... -
A Note on the Discrete Spectrum of Gaussian Wells (I): The Ground State Energy in One Dimension
(Hindawi Publishing Corporation, 2016-02-07)The ground state energy 𝐸 0(𝜆) of 𝐻 𝜆 = − 𝑑 2 /𝑑𝑥 2 − 𝜆 𝑒 −𝑥2 is computed for small values of 𝜆 by means of an approximation of an integral operator in momentum space. Such an approximation leads to a transcendental ... -
Average distance and edge-connectivity I
(Society for Industrial and Applied Mathematics, 2015-01-15)The average distance $\mu(G)$ of a connected graph G of order n is the average of the distances between all pairs of vertices of G. We prove that if G is a $\lambda$-edge-connected graph of order n, then the bounds $\mu(G) ... -
Minimum degree, leaf number and traceability
(Institute of Mathematics of the Czech Academy of Sciences, 2013-03-26)Let G be a finite connected graph with minimum degree δ. The leaf number L (G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We prove that if δ >12(L (G) + 1), then G is 2-connected. ...