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

P. S. Hemavathi, V. Lokesha

Abstract


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

Keywords


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

Full Text:

PDF

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).


Refbacks

  • There are currently no refbacks.


eISSN 0975-8607; pISSN 0976-5905