Results 11 to 20 of about 8,970,965 (255)
The Smallest Spectral Radius of Graphs with a Given Clique Number [PDF]
The Scientific World Journal, 2014 The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω≥2 are obtained.
Jing-Ming Zhang +2 more
doaj +2 more sources
On graphs with equal coprime index and clique number
AKCE International Journal of Graphs and Combinatorics, 2023 Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +2 more sources
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
exaly +3 more sources
Extremal Sombor Index of Graphs with Cut Edges and Clique Number
AxiomsThe Sombor index is defined as SO(G)=∑uv∈E(G)d2(u)+d2(v), where d(u) and d(v) represent the number of edges in the graph G connected to the vertices u and v, respectively.
Mihrigul Wali, Raxida Guji
doaj +2 more sources
A local core number based algorithm for the maximum clique problem [PDF]
Transactions on Combinatorics, 2021 The maximum clique problem (MCP) is to determine a complete subgraph of maximum cardinality in a graph. MCP is a fundamental problem in combinatorial optimization and is noticeable for its wide range of applications.
Neda Mohammadi, Mehdi Kadivar
doaj +1 more source
Exact square coloring of graphs resulting from some graph operations and products
AKCE International Journal of Graphs and Combinatorics, 2022 A vertex coloring of a graph [Formula: see text] is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors.
Priyamvada, B. S. Panda
doaj +1 more source
Tight bounds on the clique chromatic number [PDF]
, 2021 The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique, which is not an isolated vertex, is monochromatic.
Smid, Michiel +8 more
core +1 more source
Some Extremal Graphs with Respect to Sombor Index
Mathematics, 2021 Let G be a graph with set of vertices V(G)(|V(G)|=n) and edge set E(G). Very recently, a new degree-based molecular structure descriptor, called Sombor index is denoted by SO(G) and is defined as SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is the ...
Kinkar Chandra Das, Yilun Shang
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
General multiplicative Zagreb indices of graphs with given clique number [PDF]
Opuscula Mathematica, 2019 We obtain lower and upper bounds on general multiplicative Zagreb indices for graphs of given clique number and order. Bounds on the basic multiplicative Zagreb indices and on the multiplicative sum Zagreb index follow from our results. We also determine
Tomáš Vetrík, Selvaraj Balachandran
doaj +1 more source