On Numerical Isomerism of Graphs

Main Article Content

Thomas Bier
Tu How Tan

Abstract

In this paper we give the construction of non regular graphs on v ≥ 10 vertices, which are not isomorphic, but K-isomeric, that is for graphs which have the same characteristic numbers K(µ; s) for all µ and for all values of s = 1, 2, ..., v - 1. Here the characteristic numbers K (µ; s) for µ = (µ₀, µâ‚Â, µ₂) are defined to be the number of s -subsets of the vertices of the graph which induce a sub graph with precisely µ₂ edges, such that there are µ₠edges intersecting the sub graph non trivially, and consequently there are µ₀ = | E (G) |- µ₠- µ₂ edges disjoint from the sub graph.

Downloads

Download data is not yet available.

Article Details

How to Cite
Bier, T., & How Tan, T. (2003). On Numerical Isomerism of Graphs. Malaysian Journal of Science, 22(2), 135–143. Retrieved from https://sare.um.edu.my/index.php/MJS/article/view/8528
Section
Original Articles