Results 31 to 40 of about 8,970,965 (255)
Connected Domination Number and a New Invariant in Graphs with Independence Number Three [PDF]
Computer Science Journal of Moldova, 2021 Adding a connected dominating set of vertices to a graph $G$ increases its number of Hadwiger $h(G)$. Based on this obvious property in [2] we introduced a new invariant $\eta(G)$ for which $\eta(G)\leq h(G)$. We continue to study its property.
Vladimir Bercov
doaj
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
On a class of polynomials associated with the Cliques in a graph and its applications
International Journal of Mathematics and Mathematical Sciences, 1989 The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials.
E. J. Farrell
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
Clique number of tournaments [PDF]
, 2023 We introduce the notion of clique number of a tournament and investigate its relation with the dichromatic number.
Aboulker, Pierre +3 more
core
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
Clique-to-Clique Monophonic Distance in Graphs
, 2018 It is shown that the clique-to-clique monophonic center a connected graph does not lie in a single block of G.
I. Keerthi Asir (5758471) +1 more
core +1 more source
Structural Parameterizations of Clique Coloring [PDF]
, 2020 A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether a given graph has a clique ...
Lima, Paloma T. +2 more
core +1 more source
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
On General Reduced Second Zagreb Index of Graphs
Mathematics, 2022 Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc.
Lkhagva Buyantogtokh +2 more
doaj +1 more source