Results 51 to 60 of about 342,995 (169)
Independence numbers of product graphs
Journal of Combinatorial Theory, Series B, 1974 AbstractThis paper deals with the problem of determining the independence number for the strong graph-product, especially for odd cycles. Using the concepts of a point-symmetric graph and the clique-number and introducing the notion of an independence graph, we extend and generalize some results of Hales [3] for cycle-products of power three.
Sonnemann, Eckart, Krafft, Olaf
openaire +2 more sources
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +1 more source
On the 2-token graph of a graph
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi +3 more
doaj +1 more source
On The Independence Number Of Some Strong Products Of Cycle-Powers
Foundations of Computing and Decision Sciences, 2015 In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14.
Jurkiewicz Marcin +2 more
doaj +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Ramsey–Turán problems with small independence numbers
European Journal of Combinatorics20 ...
Balogh, József +3 more
openaire +2 more sources
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
Hamiltonicity, independence number, and pancyclicity
European Journal of Combinatorics, 2012 A graph on n vertices is called pancyclic if it contains a cycle of length l for all 3 \le l \le n. In 1972, Erdos proved that if G is a Hamiltonian graph on n > 4k^4 vertices with independence number k, then G is pancyclic. He then suggested that n = (k^2) should already be enough to guarantee pancyclicity.
Lee, Choongbum, Sudakov, Benny
openaire +2 more sources
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
Chromatic number, independence ratio, and crossing number
Ars Mathematica Contemporanea, 2008 Given a drawing of a graph G, two crossings are said to be dependent if they are incident with the same vertex. A set of crossings is independent if no two are dependent. We conjecture that if G is a graph that has a drawing all of whose crossings are independent, then the chromatic number of G is at most 5.
openaire +2 more sources