#### Filter Results:

#### Publication Year

1996

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The power graph of a group is the graph whose vertex set is the group, two elements being adjacent if one is a power of the other. We observe that non-isomorphic finite groups may have isomorphic power graphs, but that finite abelian groups with isomorphic power graphs must be isomorphic. We conjecture that two finite groups with isomorphic power graphs… (More)

This note explores the relation between the boxicity of undirected graphs and the Ferrers dimension of digraphs.

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

In this paper we study oriented bipartite graphs. In particular, several characterizations of bitournaments are obtained. We introduce the concept of odd-even graphs and show that any (oriented) bipartite graph can be represented by some (oriented) odd-even graph. We show that the famous Goldbach's conjecture is equivalent to the connectedness of certain… (More)

Interval graphs were used in the study of genomics by the famous molecular biologist Benzer. Later on probe interval graphs were introduced by Zhang as a generalization of interval graphs for the study of cosmid contig mapping of DNA. A tagged probe interval graph (briefly, TPIG) is motivated by similar applications to genomics, where the set of vertices is… (More)