Note on \((i,j)\)-Distance Graph of a Graph
DOI:
https://doi.org/10.26713/cma.v9i2.633Keywords:
\((i, j)\)-Distance graph, Distance \((i, j)\)-bipartite graphs, Strongly \((iAbstract
In this note, we dene the \((i,j)\)-distance graph of a graph and presented several characterizations based on this notion.Downloads
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).
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.