Results 21 to 30 of about 8,623,913 (295)
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
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
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
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
Discrete Mathematics, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, Marcel Erné
openaire +1 more source
The Ramsey number of the clique and the hypercube [PDF]
Journal of the London Mathematical Society, 2014 The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering a question of Burr and Erdős from 1983, and improving on recent results of Conlon, Fox, Lee and Sudakov, and of ...
Gonzalo Fiz Pontiveros +4 more
openaire +3 more sources
A New Implicit Branching Strategy for Exact Maximum Clique [PDF]
, 2010 We present a new implicit branching strategy for maximum clique. The new strategy is based in Konj and Janečič's improvement over reference MCR algorithm.
Tapia García, Cristóbal +3 more
core +1 more source
Galois groups of chromatic polynomials of strongly non-clique-separable graphs of order at most 10
, 2022 The chromatic polynomial P(G, λ) gives the number of proper colourings of a graph in at most λ colours. A graph G is clique-separable if it can be obtained by identifying an r-clique in a graph H 1 with an r-clique in a graph H 2.
K Morgan (13134483)
core +1 more source
Local and Global Clique Numbers
Journal of Combinatorial Theory, Series B, 1994 A graph \(G\) is said to have the \((p,q)\)-property for some integers \(p\geq q\geq 2\) if for every \(p\)-set of its vertices the induced subgraph contains a \(q\)-clique. The aim of the paper is to investigate relations of the type \((p,q)\to (n,s)\), meaning that each graph having the \((p,q)\)- property also has the \((n,s)\)-property.
Nathan Linial, Yuri Rabinovich
openaire +3 more sources