Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0504549

On Isomorphism of Graphs and the k-clique Problem

Dhananjay P. Mehendale
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and denote the bitableau that is least in this order as the standard representation for the associated graph. The standard representation characterizes graphs uniquely. The second characterization is obtained in terms of associated rooted, unordered, pseudo trees. We show that the isomorphism of two given graphs is implied by the isomorphism of their associated pseudo trees. The third characterization is obtained in terms of ordered adjacency lists to be associated with two given labeled graphs. We show the two given labeled graphs are isomorphic if and only if their associated ordered adjacency lists can be made identical by the action of suitable transpositions on any one of these lists. We discuss in brief the complexity of these characterizations described in this paper for deciding isomorphism of graphs. Finally, we discuss the k-clique problem in the light of these characterizations towards the end of the paper.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dhananjay P. Mehendale. 2015-12-15. On Isomorphism of Graphs and the k-clique Problem. https://arxiv.org/abs/math/0504549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quelques remarques sur les vari{é}t{é}s, fonctions de Green et formule de Stokes

We give some remarks on some manifolds K3 surfaces, Complex projective spaces, real projective space and Torus and the classification of two dimensional Riemannian surfaces, Green functions and the Stokes formula. We also, talk about traces of Sobolev spaces, the distance function, the notion of degree and a duality theorem, the variational formulation and conformal map in dimension 2, the metric on the boundary of a Lipschitz domain and polar geodesic coordinates and the Gauss-Bonnet formula and the positive mass theorem in dimension $ \geq 3 $ and in the flat and non flat case. And the Ricci flow. And fields and their relation to the equations.And obstructions in astronomy. And on strings, superstrings and D-branes. And topological solutions in the negative case, critical, supercritical and superstrings and symmetry. And geometrization. And Decision problem, SAT problem and p=np problem.

math.GM↗
arXiv2026

Counting Truchet Tile Balls

A formula is established that counts the number of different balls that can be made by decorating the pentagons and hexagons of a classic football with Truchet-like patterns.

math.GM↗
arXiv2026

A Theory of Scales and Orbit Covers

This paper develops a formal theory of musical scales and their harmonic coverings and introduces orbit covers: coverings obtained by translating a fixed subset across a scale via a group action. Orbit covers generalize familiar constructions, such as the covering of the diatonic scale by tertian triads, and are motivated by the search for a generalized harmonic framework extending common-practice tonality. We model modes as group structures associated with pitch-class sets and scales as torsors, introducing scale covers and, in particular, orbit covers. To each orbit cover we associate a nerve complex encoding its intersection structure and associated topological invariants. We classify triadic orbit covers of heptatonic scales up to affine symmetry and nerve isomorphism. These results support a broader theory of harmonic organization with analytical and compositional applications.

math.GM↗