EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 106

Finding the conductors in circular networks from boundary measurements

E. Curtis, E. Mooers, J. Morrow (1994)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory

Ivan Gutman, Dragoš Cvetković (1984)

Publications de l'Institut Mathématique

Finding vertex-disjoint cycle cover of undirected graph using the least-squares method

Lamač, Jan, Vlasák, Miloslav (2023)

Programs and Algorithms of Numerical Mathematics

We investigate the properties of the least-squares solution of the system of equations with a matrix being the incidence matrix of a given undirected connected graph $G$ and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph $G$ .

Finite canonization

Saharon Shelah (1996)

Commentationes Mathematicae Universitatis Carolinae

The canonization theorem says that for given $m, n$ for some $m^{*}$ (the first one is called $E R (n; m)$ ) we have for every function $f$ with domain ${[1, \dots, m^{*}]}^{n}$ , for some $A \in {[1, \dots, m^{*}]}^{m}$ , the question of when the equality $f (i_{1}, \dots, i_{n}) = f (j_{1}, \dots, j_{n})$ (where $i_{1} < \dots < i_{n}$ and $j_{1} < \dots j_{n}$ are from $A$ ) holds has the simplest answer: for some $v \subseteq {1, \dots, n}$ the equality holds iff $⋀_{ℓ \in v} i_{ℓ} = j_{ℓ}$ . We improve the bound on $E R (n, m)$ so that fixing $n$ the number of exponentiation needed to calculate $E R (n, m)$ is best possible.

Finite commutative monoids of open maps

A. Pultr, J. Sichler (1998)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs

Václav Nýdl (1981)

Commentationes Mathematicae Universitatis Carolinae

Finite nondense point set analysis

Jozef Zámožík, Mária Mišútová (1993)

Applications of Mathematics

The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory.

Finite planar vertex-transitive graphs of the regularity degree three

Bohdan Zelinka (1977)

Časopis pro pěstování matematiky

Finite simple groups of Lie type as expanders

Alexander Lubotzky (2011)

Journal of the European Mathematical Society

We prove that all finite simple groups of Lie type, with the exception of the Suzuki groups, can be made into a family of expanders in a uniform way. This confirms a conjecture of Babai, Kantor and Lubotzky from 1989, which has already been proved by Kassabov for sufficiently large rank. The bounded rank case is deduced here from a uniform result for ${S L}_{2}$ which is obtained by combining results of Selberg and Drinfeld via an explicit construction of Ramanujan graphs by Lubotzky, Samuels and Vishne.

Finite spherical geometries

Bohdan Zelinka (1981)

Časopis pro pěstování matematiky

Finite Vertex-Transitive Planar Graphs of the Regularity Degree Four or Five

Bohdan Zelinka (1975)

Matematický časopis

Finite-size scaling in percolation.

Chayes, J.T. (1998)

Documenta Mathematica

Finite-time adaptive outer synchronization between two complex dynamical networks with nonidentical topological structures

Jie Wu, Yong-zheng Sun, Dong-hua Zhao (2015)

Kybernetika

In this paper, we investigate the finite-time adaptive outer synchronization between two complex dynamical networks with nonidentical topological structures. We propose new adaptive controllers, with which we can synchronize two complex dynamical networks within finite time. Sufficient conditions for the finite-time adaptive outer synchronization are derived based on the finite-time stability theory. Finally, numerical examples are examined to demonstrate the effectiveness and feasibility of the...

Fixed point results on a metric space endowed with a finite number of graphs and applications

Hajer Argoubi, Bessem Samet, Mihai Turinici (2014)

Czechoslovak Mathematical Journal

In this paper, we consider self-mappings defined on a metric space endowed with a finite number of graphs. Under certain conditions imposed on the graphs, we establish a new fixed point theorem for such mappings. The obtained result extends, generalizes and improves many existing contributions in the literature including standard fixed point theorems, fixed point theorems on a metric space endowed with a partial order and fixed point theorems for cyclic mappings.

Currently displaying 41 – 60 of 106