Results 51 to 60 of about 8,623,913 (295)

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +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

On oriented relative clique number

Electronic Notes in Discrete Mathematics, 2015
An oriented graph is a directed graph with no cycle of length one or two. The relative clique number of an oriented graph is the order of a largest subset X of vertices such that each pair of vertices are either adjacent or connected by a directed 2-path. It is known that the oriented relative clique number of a planar graph is at most 80.
Sandip Das 0001, Swathyprabhu Mj, Sagnik Sen 0001   +2 more
openaire   +2 more sources

Note on the smallest root of the independence polynomial [PDF]

, 2013
One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core   +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

Bounds on the Clique and the Independence Number for Certain Classes of Graphs

Mathematics
In 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

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 Combinatorics
16 pages, 1 ...
Sean English, Jürgen Kritschgau, Mina Nahvi, Elizabeth Sprangel   +3 more
openaire   +4 more sources

shah314/clique: Genetic Algorithm for the Maximum Clique Problem

, 2019
<p>Implementation of a genetic algorithm for the maximum clique problem in C++. A clique of a graph is a set of vertices in which each pair in the set have an edge between them i.e. it is a complete subgraph.
Shalin Shah
core   +1 more source