Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number

Modeling and Analysis of Information Systems
doi 10.18255/1818-1015-2014-5-116-130
Full Text
Abstract

Available in full text

Date
Authors
Publisher

P.G. Demidov Yaroslavl State University

Related search

On the Clique Number of the Generating Graph of a Finite Group

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2009English

The Complexity of Clique Graph Recognition

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Comparison of Roman Domination Number With Domination Number, Independent Domination Number and Chromatic Number of a Graph

International Journal for Research in Applied Science and Engineering Technology
2019English

Coronas and Domination Subdivision Number of a Graph

Bulletin of the Malaysian Mathematical Sciences Society
Mathematics
2016English

Upper Double Monophonic Number of a Graph

Proyecciones
Mathematics
2018English

Nonsplit Geodetic Number of a Lict Graph

International Journal of Computer Applications
2014English

A Note on Nonsplitdomination Number of a Graph

IOSR Journal of Mathematics
2017English

The Upper Edge Geodetic Number and the Forcing Edge Geodetic Number of a Graph

Opuscula Mathematica
Mathematics
2009English

The Prime Number Graph

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1979English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy