Results 271 to 280 of about 336,088 (309)

Maximum Genus, Independence Number and Girth

Chinese Annals of Mathematics, 2000
The authors present an upper bound on the Betti deficiency in terms of the independence number and the girth of a graph, and give an equivalent formulation of their result in form of a lower bound on the maximum genus.
Huang, Yuanqiu, Liu, Yanpei
openaire   +1 more source

Trees with independent Roman domination number twice the independent domination number

Discrete Mathematics, Algorithms and Applications, 2015
A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text].
Chellali, Mustapha, Rad, Nader Jafari
openaire   +2 more sources

The lower bound on independence number

Science China Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zang, W, Li, Y, Rousseau, CC
openaire   +4 more sources

Exponential Independence Number of Some Graphs

International Journal of Foundations of Computer Science, 2018
Let [Formula: see text] be a graph and [Formula: see text]. We define by [Formula: see text] the subgraph of [Formula: see text] induced by [Formula: see text]. For each vertex [Formula: see text] and for each vertex [Formula: see text], [Formula: see text] is the length of the shortest path in [Formula: see text] between [Formula: see text] and ...
Aytac, Aysun, Ciftci, Canan
openaire   +2 more sources

Degree of independence of numbers

Mathematica Slovaca, 2021
Abstract A new concept of independence of real numbers, called degree independence, which contains those of linear and algebraic independences, is introduced. A sufficient criterion for such independence is established based on a 1988 result of Bundschuh, which in turn makes use of a generalization of Liouville’s estimate due to Feldman ...
Rattanamoong, Jittinart, Laohakosol, Vichian   +1 more
openaire   +2 more sources

Linear Independence Measures for Certain Numbers

Results in Mathematics, 1988
Die ganze transzendente Funktion \(\displaystyle T(z,a):=\sum_{n\geq 0}a^{-n(n-1)/2} z^n\), \(| a| >1\), ist erstmals 1921 von L. Tschakaloff arithmetisch untersucht worden, der bei \(a, \alpha_1,\ldots,\alpha_m\in\mathbb{Q}^\times\) (unter natürlichen Zusatzbedingungen) die lineare Unabhängigkeit (l.U.) von \(1, T(\alpha_1,a),\ldots,T(\alpha_m,a ...
openaire   +1 more source

Independence number and fullerene stability

Chemical Physics Letters, 2007
An independent set of a graph G is a set of vertices of G that are pairwise non-adjacent. The independence number, α(G), is the order of a maximum independent set of G. A survey of independence numbers is presented for the set of over 10 million fullerene isomers from 20 to 120 carbon atoms and comparisons are made with the pentagon adjacency count, as
P.W. Fowler, S. Daugherty, W. Myrvold
openaire   +1 more source

Independence number, connectivity, and r‐factors

Journal of Graph Theory, 1989
AbstractWe show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G ...
openaire   +1 more source

Algebraic independence of certain numbers

Acta Mathematica Sinica, 1999
Vorausgeschickt seien zwei Definitionen. \(\gamma := {b \over a} \omega\) mit teilerfremden \(a,b\in\mathbb{N}\) heißt ein streng rationales Vielfaches von \(\omega\in\mathbb{R}\setminus \mathbb{Q}\), wenn \(a\) alle Teilnenner des Kettenbruchs von \(\omega\) mit geradem Index teilt.
Zhu, Yaochen, Chen, Yonggao
openaire   +2 more sources