Rosary College – Commerce & Arts

Affiliated to the Goa University

Institutional Digital Repository

 

Communities in DSpace

Select a community to browse its collections.

Recent Submissions

No Thumbnail Available
Item
No Thumbnail Available
Item
NUMERICAL SIMULATION OF FORCED CONVECTION IN OIL SANDS USING LATTICE BOLTZMANN METHOD
(2016) Fernandes, Ignatius
Lattice Boltzmann method is used to simulate forced convection in oilsands (low permeable porous geometries). Fluid flows through a sandstone look alike square geometry with left wall of the geometry kept at higher temperature compared to other walls. Investigation is carried out to study influence of increased temperature on flow properties by observing the variation in velocity and temperature profiles for various permeability and porosity values, which were varied to match the geometrical properties of oil sands. Boundary conditions and the relaxation parameter are suitably defined to achieve convergence for low values of permeability. Simulation was carried out at low Reynolds number, which however, can be extended to higher values of Reynolds number
No Thumbnail Available
Item
On nearly distance magic graphs
(2017) Godinho, Aloysius
Let G = (V, E) be a graph on n vertices. A bijection f ∶ V → {1, 2, . . . , n} is called a nearly distance magic labeling of G if there exist a positive integer k such that ∑x∈N(v) f(x) = k or k +1 for every v ∈ V . The constant k is called magic constants of the graph and the graph which admits such a labeling is called a nearly distance magic graph. In this paper we present several basic results on nearly distance magic graphs and compute the magic constant k in terms of the fractional total domination number of the graph.
No Thumbnail Available
Item
Some distance antimagic labeled graphs
(2016) Godinho, Aloysius
Abstract. Let G be a graph of order n. A bijection f : V (G) −→ {1, 2, . . . , n} is said to be distance antimagic if for every vertex v the vertex weight defined by wf (v) = P x∈N(v) f(x) is distinct. The graph which admits such a labeling is called a distance antimagic graph. For a positive integer k, define fk : V (G) −→ {1 + k, 2 + k, . . . , n + k} by fk(x) = f(x) + k. If wfk (u) 6= wfk (v) for every pair of vertices u, v ∈ V , for any k ≥ 0 then f is said to be an arbitrarily distance antimagic labeling and the graph which admits such a labeling is said to be an arbitrarily distance antimagic graph. In this paper, we provide arbitrarily distance antimagic labelings for rPn, generalised Petersen graph P(n, k), n ≥ 5, Harary graph H4,n for n 6= 6 and also prove that join of these graphs is distance antimagic.
No Thumbnail Available
Item
Lattice Boltzmann Simulation of Forced Convection in Non-Newtonian Fluid Through Low Permeable Porous Media
(2016) Fernandes, Ignatius
Numerical simulation is carried out to study forced convection in non-Newtonian fluids flowing through low permeable porous media like sandstones and sand. Simulation is carried out using lattice Boltzmann method for both shear-thinning and shear-thickening, by varying the power-law index from 0.5 to 1.5 in Carreau-Yasuda model. Parameters involved in lattice Boltzmann method and Carreau model are identified to achieve numerical convergence. Permeability and porosity are varied in the range of 10 10