On Multiplicity of Quadrilaterals in Complete Graphs

J. Prema () and V. Vijayalakshmi ()
Additional contact information
J. Prema: Anna University, MIT Campus
V. Vijayalakshmi: Anna University, MIT Campus

Indian Journal of Pure and Applied Mathematics, 2019, vol. 50, issue 1, 83-94

Abstract: Abstract In this paper, we determine a lower bound for the multiplicity of quadrilaterals (cycles on four vertices) in complete graph Kn for any positive integer n.

Keywords: Complete graphs; edge coloring; monochromatic; multiplicity; quadrilaterals (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-019-0308-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:50:y:2019:i:1:d:10.1007_s13226-019-0308-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-019-0308-9

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().