Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Mahéo (1980)
Strongly graceful graphsDiscret. Math., 29
S. Golomb (1972)
HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555.
Z. Liang (1997)
The harmoniousness of book graph St(4k + 1) × P 2Southeast Asian Bull Math., 21
J.A. Gallian, D.S. Jungreis (1988)
Labeling booksScientia, 1
A. Rosa (1967)
On certain valuations of the vertices of a graph, Theory of Graphs (Internat Symposium Rome July 1966)
S. El-Zanati, C. Eynden (2000)
On Graphs with Strong a-valuationsArs Comb., 56
J. Gallian (2009)
A Dynamic Survey of Graph LabelingThe Electronic Journal of Combinatorics
F. Harary (1979)
Topics in graph theory
R. Read, C. Berge (1972)
Graph theory and computing
Rikio Ichishima, Akito Oshima (2010)
On Partitional Labelings of GraphsMathematics in Computer Science, 3
Sin-Min Lee, E. Schmeichel, S. Shee (1991)
On felicitous graphsDiscret. Math., 93
R. Figueroa-Centeno, Rikio Ichishima, F. Muntaner-Batle (2003)
Labeling the vertex amalgamation of graphsDiscuss. Math. Graph Theory, 23
G. Chartrand, L. Lesniak (1986)
Graphs and Digraphs, Wadsworth & Brooks/Cole Advanced Books and Software
R. Graham, N. Sloane (1980)
On Additive Bases and Harmonious GraphsSIAM J. Algebraic Discret. Methods, 1
T. Grace (1983)
On sequential labelings of graphsJ. Graph Theory, 7
The partitional graphs, which are a subclass of the sequential graphs, were recently introduced by Ichishima and Oshima (Math Comput Sci 3:39–45, 2010), and the cartesian product of a partitional graph and K 2 was shown to be partitional, sequential, harmonious and felicitous. In this paper, we present some necessary conditions for a graph to be partitional. By means of these, we study the partitional properties of certain classes of graphs. In particular, we completely characterize the classes of the graphs B m and K m,2 × Q n that are partitional. We also establish the relationships between partitional graphs and graphs with strong α-valuations as well as strongly felicitous graphs.
Mathematics in Computer Science – Springer Journals
Published: Sep 24, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.