Results 1 to 10 of about 8,970,965 (255)
The Clique Number and The Chromatics Number Of The Coprime Graph for The Generalized Quarternion Group [PDF]
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 +4 more sources
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
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
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
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
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
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
Lower bounds on the signed (total) $k$-domination number depending on the clique number
Communications in Combinatorics and Optimization, 2018 Let $G$ be a graph with vertex set $V(G)$. For any integer $k\ge 1$, a signed (total) $k$-dominating function is a function $f: V(G) \rightarrow \{ -1, 1\}$ satisfying $\sum_{x\in N[v]}f(x)\ge k$ ($\sum_{x\in N(v)}f(x)\ge k$) for every $v ...
L. Volkmann
doaj +1 more source
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