Results 31 to 40 of about 342,995 (169)
Two sufficient conditions for fractional k-deleted graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2012 Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k.
Lv Xiangyang
doaj +1 more source
Independence number in graphs and its upper bounds [PDF]
Journal of Mahani Mathematical ResearchIn this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds.
Farzad Shaveisi
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Poureidi Abolfazl, Rad Nader Jafari
openaire +2 more sources
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
The critical independence number and an independence decomposition
European Journal of Combinatorics, 2011 10 pages, 4 ...
openaire +3 more sources
A note on subspace sum graph of vector spaces
AKCE International Journal of Graphs and Combinatorics, 2021 For a finite dimensional vector space over a field the subspace sum graph of denoted by is defined to be a simple undirected graph with vertex set as the set of all non-trivial proper subspace of and, for any two distinct vertices V1 and V2 are adjacent ...
Ramanathan Venkatasalam +1 more
doaj +1 more source
On the $k$-independence number of graphs
Discrete Mathematics, 2018 © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Abiad, Aida +2 more
openaire +4 more sources
Clique immersions and independence number
European Journal of Combinatorics, 2022 13 pages, 1 figure.
Bustamante, Sebastián +3 more
openaire +3 more sources
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
Independence Number and Packing Coloring of Generalized Mycielski Graphs
Discussiones Mathematicae Graph Theory, 2021 For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(x) + 1 ...
Bidine Ez Zobair +2 more
doaj +1 more source