The Maximal Length of 2-Path in Random Critical Graphs
Joint Authors
Rasendrahasina, Vonjy
Ravelomanana, Vlady
Aly Raonenantsoamihaja, Liva
Source
Journal of Applied Mathematics
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-05-14
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
Given a graph, its 2-core is the maximal subgraph of G without vertices of degree 1.
A 2-path in a connected graph is a simple path in its 2-core such that all vertices in the path have degree 2, except the endpoints which have degree ⩾3.
Consider the Erdős-Rényi random graph G(n,M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges.
Let ξn,M be the maximum 2-path length of G(n,M).
In this paper, we determine that there exists a constant c(λ) such that Eξn,n/21+λn-1/3~c(λ)n1/3, for any real λ.
This parameter is studied through the use of generating functions and complex analysis.
American Psychological Association (APA)
Rasendrahasina, Vonjy& Ravelomanana, Vlady& Aly Raonenantsoamihaja, Liva. 2018. The Maximal Length of 2-Path in Random Critical Graphs. Journal of Applied Mathematics،Vol. 2018, no. 2018, pp.1-5.
https://search.emarefa.net/detail/BIM-1176082
Modern Language Association (MLA)
Rasendrahasina, Vonjy…[et al.]. The Maximal Length of 2-Path in Random Critical Graphs. Journal of Applied Mathematics No. 2018 (2018), pp.1-5.
https://search.emarefa.net/detail/BIM-1176082
American Medical Association (AMA)
Rasendrahasina, Vonjy& Ravelomanana, Vlady& Aly Raonenantsoamihaja, Liva. The Maximal Length of 2-Path in Random Critical Graphs. Journal of Applied Mathematics. 2018. Vol. 2018, no. 2018, pp.1-5.
https://search.emarefa.net/detail/BIM-1176082
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1176082
