Matches in SemOpenAlex for { <https://semopenalex.org/work/W4286469188> ?p ?o ?g. }
Showing items 1 to 44 of
44
with 100 items per page.
- W4286469188 abstract "The vertex-deleted subgraph G-v, obtained from the graph G by deleting the vertex v and all edges incident to v, is called a card of G. The deck of G is the multiset of its unlabelled cards. The number of common cards b(G,H) of G and H is the cardinality of the multiset intersection of the decks of G and H. A supercard G+ of G and H is a graph whose deck contains at least one card isomorphic to G and at least one card isomorphic to H. We show how maximum sets of common cards of G and H correspond to certain sets of permutations of the vertices of a supercard, which we call maximum saturating sets. We apply the theory of supercards and maximum saturating sets to the case when G is a sunshine graph and H is a caterpillar graph. We show that, for large enough n, there exists some maximum saturating set that contains at least b(G,H)-2 automorphisms of G+, and that this subset is always isomorphic to either a cyclic or dihedral group. We prove that b(G,H)<=2(n+1)/5 for large enough n, and that there exists a unique family of pairs of graphs that attain this bound. We further show that, in this case, the corresponding maximum saturating set is isomorphic to the dihedral group." @default.
- W4286469188 created "2022-07-22" @default.
- W4286469188 creator A5014473920 @default.
- W4286469188 creator A5067520533 @default.
- W4286469188 date "2020-10-16" @default.
- W4286469188 modified "2023-10-18" @default.
- W4286469188 title "Supercards, Sunshines and Caterpillar Graphs" @default.
- W4286469188 doi "https://doi.org/10.48550/arxiv.2010.08266" @default.
- W4286469188 hasPublicationYear "2020" @default.
- W4286469188 type Work @default.
- W4286469188 citedByCount "0" @default.
- W4286469188 crossrefType "posted-content" @default.
- W4286469188 hasAuthorship W4286469188A5014473920 @default.
- W4286469188 hasAuthorship W4286469188A5067520533 @default.
- W4286469188 hasBestOaLocation W42864691881 @default.
- W4286469188 hasConcept C114614502 @default.
- W4286469188 hasConcept C118615104 @default.
- W4286469188 hasConcept C132525143 @default.
- W4286469188 hasConcept C2779623528 @default.
- W4286469188 hasConcept C33923547 @default.
- W4286469188 hasConcept C80899671 @default.
- W4286469188 hasConceptScore W4286469188C114614502 @default.
- W4286469188 hasConceptScore W4286469188C118615104 @default.
- W4286469188 hasConceptScore W4286469188C132525143 @default.
- W4286469188 hasConceptScore W4286469188C2779623528 @default.
- W4286469188 hasConceptScore W4286469188C33923547 @default.
- W4286469188 hasConceptScore W4286469188C80899671 @default.
- W4286469188 hasLocation W42864691881 @default.
- W4286469188 hasLocation W42864691882 @default.
- W4286469188 hasOpenAccess W4286469188 @default.
- W4286469188 hasPrimaryLocation W42864691881 @default.
- W4286469188 hasRelatedWork W1719252778 @default.
- W4286469188 hasRelatedWork W1963961477 @default.
- W4286469188 hasRelatedWork W2008276241 @default.
- W4286469188 hasRelatedWork W2027299557 @default.
- W4286469188 hasRelatedWork W2040810174 @default.
- W4286469188 hasRelatedWork W2374778222 @default.
- W4286469188 hasRelatedWork W2555545330 @default.
- W4286469188 hasRelatedWork W2614056014 @default.
- W4286469188 hasRelatedWork W2966988768 @default.
- W4286469188 hasRelatedWork W922283457 @default.
- W4286469188 isParatext "false" @default.
- W4286469188 isRetracted "false" @default.
- W4286469188 workType "article" @default.