On the public citation graph
Spanning Trees with Many Leaves and Average Distance
0 signed · 57 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(200001)33:1<1::aid-jgt1>3.0.co;2-lopenalex-snapshot
Average distance, minimum degree, and spanning trees
inferredcites →https://doi.org/10.1002/jgt.20344openalex-snapshot
Average distance and maximum induced forest
inferredcites →https://doi.org/10.1002/jgt.3190080102openalex-snapshot
On the sum of all distances in a graph or digraph
inferredcites →https://doi.org/10.1002/jgt.3190100407openalex-snapshot
Largest bipartite subgraphs in triangle‐free graphs with maximum degree three
inferredcites →https://doi.org/10.1016/0166-218x(94)90095-7openalex-snapshot
Average distance and independence number
inferredcites →https://doi.org/10.1016/s0012-365x(00)00156-4openalex-snapshot
Using minimum degree to bound average distance
inferredcites →https://doi.org/10.1016/s0019-9958(73)90273-8openalex-snapshot
An upper bound for self-dual codes
inferredcites →https://doi.org/10.1016/s0024-3795(03)00896-6openalex-snapshot
On the two conjectures of Graffiti*1
inferredcites →https://doi.org/10.1016/s0166-218x(01)00357-2openalex-snapshot
Wiener index versus maximum degree in trees
inferredcites →https://doi.org/10.1016/s0166-218x(97)00067-xopenalex-snapshot
Average distance and domination number
inferredcites →https://doi.org/10.1016/s0304-0208(08)73549-7openalex-snapshot
On Hadwiger's Number and the Stability Number
inferredcites →https://doi.org/10.1016/s0305-0548(02)00117-xopenalex-snapshot
An exact algorithm for the maximum leaf spanning tree problem
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1016/s1071-5797(03)00011-xopenalex-snapshot
Experimental constructions of self-dual codes
inferredcites →https://doi.org/10.1023/a:1010767517079openalex-snapshot
Wiener Index of Trees: Theory and Applications
inferredcites →https://doi.org/10.1090/dimacs/069/07openalex-snapshot
On some conjectures of Griggs and graffiti
inferredcites →https://doi.org/10.1109/18.86979openalex-snapshot
Weight enumerators of self-dual codes
inferredcites →https://doi.org/10.1137/s0895480199353780openalex-snapshot
Connected Domination and Spanning Trees with Many Leaves
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22943openalex-snapshot
The extremal average distance of cubic graphs
inferred← citeshttps://doi.org/10.1002/jgt.23232openalex-snapshot
The Average Solution of a TSP Instance in a Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/s10587-013-0036-yopenalex-snapshot
Minimum degree, leaf number and traceability
inferred← citeshttps://doi.org/10.1007/s10878-016-0092-yopenalex-snapshot
On maximum Wiener index of trees and graphs with given radius
inferred← citeshttps://doi.org/10.1007/s10878-022-00850-5openalex-snapshot
Further results on the total monochromatic connectivity of graphs
inferred← citeshttps://doi.org/10.1007/s13370-017-0503-yopenalex-snapshot
Leaf number and Hamiltonian $$C_4$$ C 4 -free graphs
inferred← citeshttps://doi.org/10.1007/s13370-018-0605-1openalex-snapshot
Graphs with forbidden subgraphs and leaf number
inferred← citeshttps://doi.org/10.1016/j.amc.2019.03.025openalex-snapshot
Graphs with a given diameter that maximise the Wiener index
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.018openalex-snapshot
On spanning cycles, paths and trees
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.023openalex-snapshot
Upper bounds on the average eccentricity
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.028openalex-snapshot
On minimum degree, leaf number, traceability and Hamiltonicity in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.011openalex-snapshot
On eccentric distance sum and degree distance of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.009openalex-snapshot
Further results on the Merrifield–Simmons index
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.019openalex-snapshot
Comparative results and bounds for the eccentric-adjacency index
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.006openalex-snapshot
Average distance and generalised packing in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.010openalex-snapshot
Average distance in weighted graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.06.003openalex-snapshot
An asymptotic resolution of a problem of Plesník
inferred← citeshttps://doi.org/10.1017/s0004972713000816openalex-snapshot
WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
inferred← citeshttps://doi.org/10.1017/s0004972718000163openalex-snapshot
ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS
inferred← citeshttps://doi.org/10.1080/09720529.2020.1766761openalex-snapshot
Bounds on the leaf number in graphs of girth 4 or 5
inferred← citeshttps://doi.org/10.1080/09728600.2023.2183913openalex-snapshot
Average distance and connected domination
inferred← citeshttps://doi.org/10.1155/2013/906756openalex-snapshot
Wiener Index of Graphs with Radius Two
inferred← citeshttps://doi.org/10.12677/aam.2020.93038openalex-snapshot
The Maximal Wiener Index of UnicyclicGraph with Given Diameter and Order
inferred← citeshttps://doi.org/10.17846/amn.2015.1.1.44-49openalex-snapshot
Selected Topics in the Extremal Graph Theory
inferred← citeshttps://doi.org/10.2298/fil1817809hopenalex-snapshot
Relationships between some distance-based topological indices
inferred← citeshttps://doi.org/10.26493/1855-3974.312.679openalex-snapshot
Average distance, radius and remoteness of a graph
inferred← citeshttps://doi.org/10.26493/1855-3974.795.ebfopenalex-snapshot
Mathematical aspects of Wiener index
inferred← citeshttps://doi.org/10.3934/math.2024770openalex-snapshot
Graphs with a given conditional diameter that maximize the Wiener index
inferred← citeshttps://doi.org/10.4153/cmb-2013-020-5openalex-snapshot
Size, Order, and Connected Domination
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.120.02.115openalex-snapshot
Minimum Degree, Leaf Number, and Hamiltonicity
inferred← citeshttps://doi.org/10.47443/ejm.2023.027openalex-snapshot
Connected domination number and traceable graphs
inferred← citeshttps://doi.org/10.47443/ejm.2023.040openalex-snapshot
On a conjecture of Chellali and Favaron regarding connected domination numbers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.