Results 31 to 40 of about 8,457 (169)
Zero-sum partition theorems for graphs
International Journal of Mathematics and Mathematical Sciences, 1994 Let q=pn be a power of an odd prime p. We show that the vertices of every graph G can be partitioned into t(q) classes V(G)=⋃t=1t(q)Vi such that the number of edges in any induced subgraph 〈Vi〉 is divisible by q, where t(q)≤32(q−1)−(2(q−1)−1)124+98, and ...
Y. Caro, I. Krasikov, Y. Roditty
doaj +1 more source
A Transformation Which Preserves the Clique Number
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gerber, Michael U., Hertz, Alain
openaire +1 more source
Getting new algorithmic results by extending distance-hereditary graphs via split composition [PDF]
PeerJ Computer Science, 2021 In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components.
Serafino Cicerone, Gabriele Di Stefano
doaj +2 more sources
Automorphisms and Distinguishing Numbers of Geometric Cliques [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albertson, Michael O., Boutin, Debra L.
openaire +2 more sources
Community Detection in Complex Network Based on Triangle Clique Attractors [PDF]
Jisuanji gongcheng, 2016 Aiming at the problem that complex network community detection process is complex and time complexity is high,according to the numerical relationship of triangle clique between nodes,a community detection algorithm is designed based on triangle clique ...
CAI Biao,TUO Xianguo,SANG Qiang,YANG Kaixue,LIU Lizhao
doaj +1 more source
An upper bound for the clique number using clique ceiling numbers
, 2019 In this article we present the idea of clique ceiling numbers of the vertices of a given graph that has a universal vertex. We follow up with a polynomial-time algorithm to compute an upper bound for the clique number of such a graph using clique ceiling numbers. We compare this algorithm with some upper bound formulas for the clique number.
Dharmarajan, R., Ramachandran, D.
openaire +2 more sources
Prime ideal graphs of commutative rings
Indonesian Journal of Combinatorics, 2022 Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj +1 more source
Saturation numbers for Berge cliques
European Journal of Combinatorics16 pages, 1 ...
English, Sean +3 more
openaire +3 more sources
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
Comments on the Clique Number of Zero-Divisor Graphs of Zn
Journal of Mathematics, 2022 In 2008, J. Skowronek-kazio´w extended the study of the clique number ωGZn to the zero-divisor graph of the ring Zn, but their result was imperfect. In this paper, we reconsider ωGZn of the ring Zn and give some counterexamples. We propose a constructive
Yanzhao Tian, Lixiang Li
doaj +1 more source