Browsing Department of Mathematics Staff Publications by Issue Date
Now showing items 19 of 9

Unsteady contact melting of a rectangular cross section material on a flat plate.
(American Institute of Physics, 20081006)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 ... 
Minimum degree, leaf number and traceability
(Institute of Mathematics of the Czech Academy of Sciences, 20130326)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 2connected. ... 
Application of citrus sinensis solid waste as a pseudo catalyst for free cyanide conversion under alkaline conditions
(BioResources, 20130508)In this study, Citrus sinensis (C. sinensis) solid waste was used to catalyze the conversion of free cyanide (FCN) under alkaline conditions; conditions which represent most industrial wastewater containing FCN. Acid ... 
Average distance and edgeconnectivity I
(Society for Industrial and Applied Mathematics, 20150115)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$edgeconnected graph of order n, then the bounds $\mu(G) ... 
The Gutman Index and the EdgeWiener Index of Graphs with given VertexConnectivity
(University of Zielona Góra, 20151230)The Gutman index and the edgeWiener 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 ... 
A Note on the Discrete Spectrum of Gaussian Wells (I): The Ground State Energy in One Dimension
(Hindawi Publishing Corporation, 20160207)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 ... 
Spanning paths in graphs
(Elsevier, 20180829)The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na, state that every simple connected graph G with minimum degree δ and leaf number L(G) such that δ ≥ 1 2 (L(G) + 1), is traceable. ... 
An Upper Bound on the Radius of a 3VertexConnected C4Free Graph
(HINDAWI, 20200804)Let G=(V,E) be a finite, connected, undirected graph with vertex set V and edge set E. e distance dG (u,v) between two vertices u, v of G is the length of a shortest uv path in G.e eccentricity ec(v)of a vertex v∈V is ... 
Upper Bounds on the Diameter of Bipartite and TriangleFree Graphs with Prescribed Edge Connectivity
(HINDAWI, 20200903)Graph theory is used to study the mathematical structures of pairwise relations among objects. Mathematically, a pair G=(V,E) is a crisp graph, where V is a nonempty set and E is a relation on V[1]. e order of a graph G ...