Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

493
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

280
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

2

Information Journal Paper

Title

ON DIAMETER OF LINE GRAPHS

Pages

  105-109

Keywords

DIAMETER (OF GRAPH) 
DISTANCE (IN GRAPH) 

Abstract

 The diameter of a connected graph G, denoted by diam (G), is the maximum distance between any pair of vertices of G. Let L (G) be the LINE GRAPH of G. We establish necessary and sufficient conditions under which for a given integer k³2, diam (L(G))£k.

Cites

References

Cite

APA: Copy

RAMANE, HARISHCHANDRA S., GUTMAN, IVAN, & GANAGI, ASHA B.. (2013). ON DIAMETER OF LINE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 8(1), 105-109. SID. https://sid.ir/paper/310350/en

Vancouver: Copy

RAMANE HARISHCHANDRA S., GUTMAN IVAN, GANAGI ASHA B.. ON DIAMETER OF LINE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2013;8(1):105-109. Available from: https://sid.ir/paper/310350/en

IEEE: Copy

HARISHCHANDRA S. RAMANE, IVAN GUTMAN, and ASHA B. GANAGI, “ON DIAMETER OF LINE GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 8, no. 1, pp. 105–109, 2013, [Online]. Available: https://sid.ir/paper/310350/en

Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops





    Move to top