Matches in SemOpenAlex for { <https://semopenalex.org/work/W4308830657> ?p ?o ?g. }
Showing items 1 to 52 of
52
with 100 items per page.
- W4308830657 abstract "We study the problem of maximizing the number of full degree vertices in a spanning tree $T$ of a graph $G$; that is, the number of vertices whose degree in $T$ equals its degree in $G$. In cubic graphs, this problem is equivalent to maximizing the number of leaves in $T$ and minimizing the size of a connected dominating set of $G$. We provide an algorithm which produces (w.h.p.) a tree with at least $0.4591n$ vertices of full degree (and also, leaves) when run on a random cubic graph. This improves the previously best known lower bound of $0.4146 n$. We also provide lower bounds on the number of full degree vertices in the random regular graph $G(n,r)$ for $r le 10$." @default.
- W4308830657 created "2022-11-16" @default.
- W4308830657 creator A5028085743 @default.
- W4308830657 creator A5040853488 @default.
- W4308830657 date "2022-11-10" @default.
- W4308830657 modified "2023-10-11" @default.
- W4308830657 title "Full Degree Spanning Trees in Random Regular Graphs" @default.
- W4308830657 doi "https://doi.org/10.48550/arxiv.2211.05726" @default.
- W4308830657 hasPublicationYear "2022" @default.
- W4308830657 type Work @default.
- W4308830657 citedByCount "0" @default.
- W4308830657 crossrefType "posted-content" @default.
- W4308830657 hasAuthorship W4308830657A5028085743 @default.
- W4308830657 hasAuthorship W4308830657A5040853488 @default.
- W4308830657 hasBestOaLocation W43088306571 @default.
- W4308830657 hasConcept C114614502 @default.
- W4308830657 hasConcept C118615104 @default.
- W4308830657 hasConcept C121332964 @default.
- W4308830657 hasConcept C132525143 @default.
- W4308830657 hasConcept C24890656 @default.
- W4308830657 hasConcept C2775997480 @default.
- W4308830657 hasConcept C33923547 @default.
- W4308830657 hasConcept C47458327 @default.
- W4308830657 hasConcept C64271015 @default.
- W4308830657 hasConcept C64331007 @default.
- W4308830657 hasConceptScore W4308830657C114614502 @default.
- W4308830657 hasConceptScore W4308830657C118615104 @default.
- W4308830657 hasConceptScore W4308830657C121332964 @default.
- W4308830657 hasConceptScore W4308830657C132525143 @default.
- W4308830657 hasConceptScore W4308830657C24890656 @default.
- W4308830657 hasConceptScore W4308830657C2775997480 @default.
- W4308830657 hasConceptScore W4308830657C33923547 @default.
- W4308830657 hasConceptScore W4308830657C47458327 @default.
- W4308830657 hasConceptScore W4308830657C64271015 @default.
- W4308830657 hasConceptScore W4308830657C64331007 @default.
- W4308830657 hasLocation W43088306571 @default.
- W4308830657 hasLocation W43088306572 @default.
- W4308830657 hasOpenAccess W4308830657 @default.
- W4308830657 hasPrimaryLocation W43088306571 @default.
- W4308830657 hasRelatedWork W1982523511 @default.
- W4308830657 hasRelatedWork W2030579180 @default.
- W4308830657 hasRelatedWork W2032442730 @default.
- W4308830657 hasRelatedWork W2043958520 @default.
- W4308830657 hasRelatedWork W2060648678 @default.
- W4308830657 hasRelatedWork W2062226917 @default.
- W4308830657 hasRelatedWork W2157421865 @default.
- W4308830657 hasRelatedWork W2254381352 @default.
- W4308830657 hasRelatedWork W2962757025 @default.
- W4308830657 hasRelatedWork W4256214929 @default.
- W4308830657 isParatext "false" @default.
- W4308830657 isRetracted "false" @default.
- W4308830657 workType "article" @default.