Results 61 to 70 of about 342,995 (169)
On estimation of extremal entries of the principal eigenvector of a graph
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component ...
Prohelika Das, Bipanchy Buzarbarua
doaj +1 more source
Bounds on the 2-domination number in cactus graphs [PDF]
Opuscula Mathematica, 2006 A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj
Power graphs and a combinatorial property of abundant semigroups
AKCE International Journal of Graphs and CombinatoricsThe aim of this paper is to study the power graph of a semigroup. We obtain sufficient and necessary conditions for the independence number of the power graph of an (IC) abundant semigroups (superabundant semigroups) to be finite.
Junying Guo, Xiaojiang Guo
doaj +1 more source
A dynamic domination problem in trees [PDF]
Transactions on Combinatorics, 2015 We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
Device Independent Random Number Generation
, 2015 64 pages, 27 ...
Pivoluska, Mataj, Plesch, Martin
openaire +2 more sources
Distance-2 Independent Domination Numbers
DEStech Transactions on Computer Science and Engineering, 2017 The distance d(u,v) between two vertices u and v in a graph G equals the length of a shortest path from u to v. A distance-2 independent set of a graph G is a subset I of the vertices such that the distance between any two vertices of I in G is at least three.
Min-Jen JOU +3 more
openaire +2 more sources
Independence numbers of polyhedral graphs
Applied Mathematics and ComputationA polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.
Gaspoz S., Maffucci R. W.
openaire +4 more sources
Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
Theory and Applications of Graphs, 2015 The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic ...
Peter Johnson, Xiaoya Zha
doaj +1 more source
Independence numbers of product graphs
Applied Mathematics Letters, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jha, P.K., Slutzki, G.
openaire +2 more sources
On the Independence Number of Edge Chromatic Critical Graphs
Discussiones Mathematicae Graph Theory, 2014 In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree △ and independence number α (G), α (G) ≤. It is known that α (G) < |V |. In this paper we improve this bound when △≥ 4.
Pang Shiyou +3 more
doaj +1 more source