On the Mean Order of Connected Induced Subgraphs of Block Graphs

Kristaps J. Balodis, Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann

Type: Preprint

Publication Date: 2018-01-01

Citations: 8

DOI: https://doi.org/10.48550/arxiv.1811.05430

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	On the Mean Order of Connected Induced Subgraphs of Block Graphs	2018	Kristaps J. Balodis Lucas Mol Ortrud R. Oellermann Matthew E. Kroeker
+	On the maximum mean subtree order of trees	2020	Stijn Cambie Stephan Wagner Hua Wang
+	A Lower Bound on the Average Size of a Connected Vertex Set of a Graph	2021	Andrew Vince
+	A Lower Bound on the Average Size of a Connected Vertex Set of a Graph	2021	Andrew Vince
+ PDF Chat	A lower bound on the average size of a connected vertex set of a graph	2021	Andrew Vince
+	On the maximum mean subtree order of trees	2021	Stijn Cambie Stephan Wagner Hua Wang
+	On the Mean Connected Induced Subgraph Order of Cographs	2017	Matthew E. Kroeker Lucas Mol Ortrud R. Oellermann
+	The Average Size of a Connected Vertex Set of a $k$-connected Graph	2021	Andrew Vince
+	The Average Size of a Connected Vertex Set of a $k$-connected Graph	2021	Andrew Vince
+	On the mean connected induced subgraph order of cographs.	2018	Matthew E. Kroeker Lucas Mol Ortrud R. Oellermann
+	On the maximum local mean order of sub‐k $k$‐trees of a k $k$‐tree	2024	Zhuo Li Tianlong Ma Fengming Dong Xian'an Jin
+	The path minimises the average size of a connected induced subgraph	2022	John Haslegrave
+	On the maximum local mean order of sub-k-trees of a k-tree	2023	Zhuo Li Tianlong Ma Fengming Dong Xian’an Jin
+	On the Mean Subtree Order of Graphs Under Edge Addition	2019	Ben Cameron Lucas Mol
+	Decreasing the mean subtree order by adding $k$ edges	2023	Stijn Cambie Guantao Chen Yanli Hao Nizamettin Tokar
+ PDF Chat	On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees	2023	Zuwen Luo Kexiang Xu
+ PDF Chat	On Extremal Sombor Index of Trees with a Given Independence Number $\Alpha$	2023	Joyentanuj Das
+	On extremal Sombor index of trees with a given independence number $α$	2022	Joyentanuj Das
+	Bounding mean orders of sub-$k$-trees of $k$-trees	2023	Stijn Cambie B. K. McCoy Stephan M. Wagner Corrine Yap
+ PDF Chat	Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees	2024	Stijn Cambie B. K. McCoy Stephan M. Wagner Corrine Yap

Works That Cite This (7)

Action	Title	Year	Authors
+	The path minimises the average size of a connected induced subgraph	2022	John Haslegrave
+	The average order of a connected induced subgraph of a graph and union‐intersection systems	2023	Andrew Vince
+ PDF Chat	A lower bound on the average size of a connected vertex set of a graph	2021	Andrew Vince
+ PDF Chat	On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees	2023	Zuwen Luo Kexiang Xu
+ PDF Chat	A Survey of Maximal k-Degenerate Graphs and k-Trees	2024	Allan Bickle
+	A tight upper bound on the average order of dominating sets of a graph	2024	Iain Beaton Ben Cameron
+ PDF Chat	The average size of a connected vertex set of a k-connected graph	2021	Andrew Vince

Works Cited by This (7)

Action	Title	Year	Authors
+	On the Local and Global Means of Subtree Orders	2015	Stephan Wagner Hua Wang
+	On the average number of nodes in a subtree of a tree	1983	Robert E. Jamison
+	The mean order of sub‐<i>k</i>‐trees of <i>k</i>‐trees	2017	Alexander M. Stephens Ortrud R. Oellermann
+	Subtrees of graphs	2018	Alex Chin Gary Gordon Kellie J. MacPhee C.H. Vincent
+	The average size of independent sets of graphs	2018	Eric Ould Dadah Andriantiana Valisoa Razanajatovo Misanantenaina Stephan Wagner
+	On the mean connected induced subgraph order of cographs.	2018	Matthew E. Kroeker Lucas Mol Ortrud R. Oellermann
+ PDF Chat	Maximizing the mean subtree order	2018	Lucas Mol Ortrud R. Oellermann