Results 11 to 20 of about 8,457 (169)
Rainbow Turán number of clique subdivisions
European Journal of Combinatorics, 2023 We show that for any integer $t\geq 2$, every properly edge-coloured graph on $n$ vertices with more than $n^{1+o(1)}$ edges contains a rainbow subdivision of $K_t$. Note that this bound on the number of edges is sharp up to the $o(1)$ error term. This is a rainbow analogue of some classical results on clique subdivisions and extends some results on ...
Jiang, Tao +2 more
openaire +2 more sources
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +1 more source
General multiplicative Zagreb indices of graphs with given clique number [PDF]
Opuscula Mathematica, 2019 We obtain lower and upper bounds on general multiplicative Zagreb indices for graphs of given clique number and order. Bounds on the basic multiplicative Zagreb indices and on the multiplicative sum Zagreb index follow from our results. We also determine
Tomáš Vetrík, Selvaraj Balachandran
doaj +1 more source
, 2023 We introduce the notion of clique number of a tournament and investigate its relation with the dichromatic number. In particular, it permits defining $\dic$-bounded classes of tournaments, which is the paper's main topic.
Aboulker, Pierre +3 more
openaire +2 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
On graphs with equal coprime index and clique number
AKCE International Journal of Graphs and Combinatorics, 2023 Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +1 more source
On annihilator graph of a finite commutative ring [PDF]
Transactions on Combinatorics, 2017 The annihilator graph $AG(R)$ of a commutative ring $R$ is a simple undirected graph with the vertex set $Z(R)^*$ and two distinct vertices are adjacent if and only if $ann(x) cup ann(y)$ $ neq $ $ann(xy)$.
Sanghita Dutta, Chanlemki Lanong
doaj +1 more source
On the Planarity of Graphs Associated with Symmetric and Pseudo Symmetric Numerical Semigroups
Mathematics, 2023 Let S(m,e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call a graph GS an S(m,e)-graph if there exists a numerical semigroup S∈S(m,e) with V(GS)={x:x∈g(S)} and E(GS)={xy⇔x+y∈S}, where g(S) denotes the gap set of S.
Yongsheng Rao +4 more
doaj +1 more source
Clique Search in Graphs of Special Class and Job Shop Scheduling
Mathematics, 2022 In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with k colors and we are looking for a clique with k nodes in the graph.
Sándor Szabó, Bogdán Zaválnij
doaj +1 more source
Inverse Clique Domination in Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set.
Carmelita Loquias +2 more
doaj +1 more source