Note on \((i,j)\)-Distance Graph of a Graph

P. S. Hemavathi; V. Lokesha

doi:10.26713/cma.v9i2.633

Authors

P. S. Hemavathi Department of Mathematics, Siddaganga Institute of Technology, B.H. Road, Tumkur 572103, India; Department of Studies in Mathematics, Vijayanagara Sri Krishnadevaraya University, Ballari 583105, India
V. Lokesha Department of studies in Mathematics, V. S. K. University, Jnana Sagara Campus, Vinayaka Nagara, Ballari 583105, Karnataka

DOI:

https://doi.org/10.26713/cma.v9i2.633

Keywords:

\((i, j)\)-Distance graph, Distance \((i, j)\)-bipartite graphs, Strongly \((i

Abstract

In this note, we dene the \((i,j)\)-distance graph of a graph and presented several characterizations based on this notion.

525 329

Downloads

Download data is not yet available.

References

G.T. Chartrand and P. Zhang, An Introduction to Graph Theory, Walter Rudin Series in Advanced Mathematics, McGraw Hill Companies Inc., New York (2005).

E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1(1) (1959), 269 – 271.

F. Harary, Graph Theory, Addison-Wesley Publ. Comp., Massachusetts, Reading (1969).

P. Siva Kota Reddy, P.S. Hemavathi and V. Lokesha, Generalization of bipartite graphs, (communicated for publication).

D.B. West, Introduction to Graph Theory, Prentice-Hall of India Pvt. Ltd. (1999).