The IC-indices of complete bipartite graphs.
Shiue, Chin-Lin, Fu, Hung-Lin (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Shiue, Chin-Lin, Fu, Hung-Lin (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Goatin, P., LeFloch, P.G. (2001)
Portugaliae Mathematica. Nova Série
Similarity:
Yang, Rui, Hou, Xinmin, Li, Ning, Zhong, Wei (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jozef Kačur (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Cheung, Wing-Sum, Zhao, Chang-Jian (2007)
Journal of Inequalities and Applications [electronic only]
Similarity:
Hamid El Ouardi (2007)
Archivum Mathematicum
Similarity:
This paper is concerned with the asymptotic behaviour of a class of doubly nonlinear parabolic systems. In particular, we prove the existence of the global attractor which has, in one and two space dimensions, finite fractal dimension.
El Hachimi, A., El Quardi, H. (2001)
Electronic Journal of Qualitative Theory of Differential Equations [electronic only]
Similarity:
Jozef Kacur, Roger Van Keer (2001)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
A new approximation scheme is presented for the mathematical model of convection-diffusion and adsorption. The method is based on the relaxation method and the method of characteristics. We prove the convergence of the method and present some numerical experiments in 1D. The results can be applied to the model of contaminant transport in porous media with multi-site, equilibrium and non-equilibrium type of adsorption.
Biswajit Deb, Kalpesh Kapoor (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole. Consider a single player game in which a robot or obstacle can be moved to adjacent vertex if it has a hole. The objective is to take the robot to a fixed destination vertex using minimum number of moves. In general, it is not necessary that the robot will take...