Results 31 to 40 of about 8,766 (207)
Discrete Mathematics, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdös, Paul, Erné, Marcel
openaire +1 more source
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
Algorithms, 2021 This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj +1 more source
Chromatic and clique numbers of a class of perfect graphs [PDF]
Transactions on Combinatorics, 2015 Let p be a prime number and n be a positive integer. The graph G p (n) is a graph with vertex set [n]=1,2,ldots,n , in which there is an arc from u to v if and only if uneqv and pnmidu+v . In this paper it is shown that G p (n) is a perfect
Mohammad Reza Fander
doaj
An optimization algorithm for maximum quasi-clique problem based on information feedback model [PDF]
PeerJ Computer ScienceThe maximum clique problem in graph theory is a well-known challenge that involves identifying the complete subgraph with the highest number of nodes in a given graph, which is a problem that is hard for nondeterministic polynomial time (NP-hard problem).
Shuhong Liu +4 more
doaj +2 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Graph theory can give a representation of abstract mathematical systems such as groups or rings. We have many graph representations for a group, in this study we use the coprime graph representation for a generalized quaternion group to find the ...
Marena Rahayu Gayatri +5 more
doaj +1 more source
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