Results 41 to 50 of about 8,623,913 (295)
Detecting highly overlapping community structure by greedy clique expansion [PDF]
, 2010 Paper presented at the 4th SNA-KDD Workshop ’10 (SNA-KDD’10), held in conjunction with The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), July 25, 2010, Washington, DC USAIn complex networks it is common for
Neil Hurley +7 more
core +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
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
Perfect folding of graphs [PDF]
Delta Journal of Science, 2019 In this paper we introduced the definition of perfect foldingof graphs and we proved that cycle graphs of even number ofedges can be perfectly folded while that of odd number ofedges can be perfectly folded to C3 .
H. Ahmed, E. M. El-Kholy
doaj +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
A generalization for the clique and independence numbers
The Electronic Journal of Linear Algebra, 2012 In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.
Maden (Gungor), A. Dilek +1 more
openaire +2 more sources
On the Number of Graphs Without Large Cliques [PDF]
SIAM Journal on Discrete Mathematics, 2014 In 1976 Erdos, Kleitman and Rothschild determined the number of graphs without a clique of size $\ell$. In this note we extend their result to the case of forbidden cliques of increasing size. More precisely we prove that for $\ell_n \le \frac12(\log n)^{1/4}$ there are $$2^{(1-1/(\ell_n-1))n^2/2+o(n^2/\ell_n)}$$ $K_{\ell_n}$-free graphs of order $n ...
Frank Mousset +2 more
openaire +3 more sources
on the number of cliques and cycles in graphs
Transactions on Combinatorics, 2013 We give a new recursive method to compute the number of cliques and cycles of a graph. This method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph.
Ariannejad, Masoud, Emami, Mojgan
openaire +2 more sources
Number of Cliques in Graphs with a Forbidden Subdivision [PDF]
SIAM Journal on Discrete Mathematics, 2015 We prove that for all positive integers $t$, every $n$-vertex graph with no $K_t$-subdivision has at most $2^{50t}n$ cliques. We also prove that asymptotically, such graphs contain at most $2^{(5+o(1))t}n$ cliques, where $o(1)$ tends to zero as $t$ tends to infinity. This strongly answers a question of D.
Lee, Choongbum, Oum, Sang-il
openaire +6 more sources