Results 11 to 20 of about 390,323 (304)
The critical independence number and an independence decomposition
European Journal of Combinatorics, 2011 10 pages, 4 ...
Larson, C.E., C.E. Larson
openaire +4 more sources
Clique immersions and independence number
European Journal of Combinatorics, 2022 13 pages, 1 figure.
Sebastián Bustamante 0001 +3 more
openaire +4 more sources
Bounds for the Independence Number in $k$-Step Hamiltonian Graphs [PDF]
Computer Science Journal of Moldova, 2018 For a given integer $k$, a graph $G$ of order $n$ is called $k$-step Hamiltonian if there is a labeling $v_1,v_2,...,v_n$ of vertices of $G$ such that $d(v_1,v_n)=d(v_i,v_{i+1})=k$ for $i=1,2,...,n-1$.
Noor A'lawiah Abd Aziz +3 more
doaj +1 more source
Average distance and independence number
Discrete Applied Mathematics, 1994 For a connected graph \(G\) of order \(n\), the average distance \(\mu(G)\) is defined as \[ \mu(G)= \left({n\atop 2}\right)^{-1} \sum_{u,v\in V(G)} d(u,v), \] where \(d(u,v)\) denotes the length of a shortest path joining the vertices \(u\) and \(v\).
Dankelmann, P.
openaire +2 more sources
On the Signed (Total) K-Independence Number in Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph. A function f : V (G) → {−1, 1} is a signed k- independence function if the sum of its function values over any closed neighborhood is at most k − 1, where k ≥ 2.
Khodkar Abdollah +2 more
doaj +2 more sources
Relating the independence number and the dissociation number
Journal of Graph Theory, 2023 AbstractThe independence number and the dissociation number of a graph are the largest orders of induced subgraphs of of maximum degree at most 0 and at most 1, respectively. We consider possible improvements of the obvious inequality . For connected cubic graphs distinct from , we show , and describe the rich and interesting structure of the ...
Felix Bock +3 more
openaire +3 more sources
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
doaj +1 more source
A generalization of the independence number
Discrete Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
Mathematics, 2019 Graph invariants are the properties of graphs that do not change under graph isomorphisms, the independent set decision problem, vertex covering problem, and matching number problem are known to be NP-Hard, and hence it is not believed that there are ...
Eman AbuHijleh +3 more
doaj +1 more source
New Bounds for the α-Indices of Graphs
Mathematics, 2020 Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G.
Eber Lenes +2 more
doaj +1 more source