On the public citation graph

Asymmetric trees with two prescribed degrees

https://doi.org/10.1007/bf01896481
0 signed · 66 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01297617openalex-snapshot
Symmetric relations (undirected graphs) with given semigroups
inferredcites →https://doi.org/10.1007/bf01319053openalex-snapshot
Graphs with given infinite group
inferredcites →https://doi.org/10.1007/bf01369667openalex-snapshot
Groups represented by homeomorphism groups I
inferredcites →https://doi.org/10.1007/bf02570800openalex-snapshot
On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
inferredcites →https://doi.org/10.1016/0021-8693(69)90054-4openalex-snapshot
How comprehensive is the category of semigroups?
inferredcites →https://doi.org/10.1016/0095-8956(71)90038-4openalex-snapshot
Every finite graph is a full subgraph of a rigid graph
inferredcites →https://doi.org/10.4153/cjm-1949-033-6openalex-snapshot
Graphs of Degree Three with a Given Abstract Group
inferredcites →https://doi.org/10.4153/cjm-1957-060-7openalex-snapshot
Graphs with Given Group and Given Graph-Theoretical Properties
inferredcites →https://doi.org/10.4153/cjm-1966-121-7openalex-snapshot
On Rigid Undirected Graphs
inferredcites →https://doi.org/10.4153/cjm-1969-165-5openalex-snapshot
The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
inferredcites →https://doi.org/10.4153/cmb-1970-071-3openalex-snapshot
Graphs and k-Societies

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.22809openalex-snapshot
Distinguishing infinite graphs with bounded degrees
inferred← citeshttps://doi.org/10.1002/jgt.22923openalex-snapshot
Distinguishing threshold of graphs
inferred← citeshttps://doi.org/10.1002/jgt.23013openalex-snapshot
The distinguishing index of graphs with infinite minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.23181openalex-snapshot
Breaking small automorphisms by list colourings
inferred← citeshttps://doi.org/10.1002/jgt.3190080406openalex-snapshot
Circulants and their connectivities
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/978-94-011-5454-3_14openalex-snapshot
Some Work on Vertex-Transitive Graphs by Chinese Mathematicians
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_1openalex-snapshot
Isomorphism and Cayley graphs on abelian groups
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_7openalex-snapshot
Finite transitive permutation groups and finite vertex-transitive graphs
inferred← citeshttps://doi.org/10.1007/bf02662018openalex-snapshot
On circulant digraphs with regular automorphism groups
inferred← citeshttps://doi.org/10.1007/bf02880789openalex-snapshot
Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5
inferred← citeshttps://doi.org/10.1007/s00605-020-01420-9openalex-snapshot
Asymmetrizing trees of maximum valence $$2^{\aleph _0}$$
inferred← citeshttps://doi.org/10.1007/s10801-006-0052-1openalex-snapshot
Further restrictions on the structure of finite CI-groups
inferred← citeshttps://doi.org/10.1007/s10801-010-0257-1openalex-snapshot
Tetravalent half-arc-transitive graphs of order 2pq
inferred← citeshttps://doi.org/10.1007/s10801-011-0311-7openalex-snapshot
Classifying a family of edge-transitive metacirculant graphs
inferred← citeshttps://doi.org/10.1007/s11425-007-0017-4openalex-snapshot
Two sufficient conditions for non-normal Cayley graphs and their applications
inferred← citeshttps://doi.org/10.1007/s12188-016-0167-9openalex-snapshot
On a theorem of Halin
inferred← citeshttps://doi.org/10.1007/s40995-022-01379-2openalex-snapshot
Distinguishing Threshold for Some Graph Operations
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90341-xopenalex-snapshot
Asymmetrising sets in trees
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90342-yopenalex-snapshot
Asymmetrization of infinite trees
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126939openalex-snapshot
Proper distinguishing arc-colourings of symmetric digraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129310openalex-snapshot
Distinguishing infinite star-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.023openalex-snapshot
Asymmetric colorings of products of graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111984openalex-snapshot
Number of distinguishing colorings and partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114492openalex-snapshot
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103034openalex-snapshot
Distinguishing index of maps
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103145openalex-snapshot
A bound for the distinguishing index of regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103526openalex-snapshot
Asymmetric edge-colorings of graphs with three colors
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.10.033openalex-snapshot
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70380-5openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.1017/s0004972700030999openalex-snapshot
On finite groups with the Cayley invariant property
inferred← citeshttps://doi.org/10.1017/s0004972700032068openalex-snapshot
On isomorphisms of connected Cayley graphs, III
inferred← citeshttps://doi.org/10.1017/s0004972700034055openalex-snapshot
Groups with a Cayley graph isomorphic to a hypercube
inferred← citeshttps://doi.org/10.1017/s1446788700022527openalex-snapshot
Counting 2-circulant graphs
inferred← citeshttps://doi.org/10.1080/00927879608825668openalex-snapshot
The finite groups with the 2-dci property
inferred← citeshttps://doi.org/10.1080/00927879608825778openalex-snapshot
The finite simple groups with at most two fusion classes of every order
inferred← citeshttps://doi.org/10.1112/blms.12824openalex-snapshot
Asymmetric colouring of locally compact permutation groups
inferred← citeshttps://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferred← citeshttps://doi.org/10.1142/s0219498816501759openalex-snapshot
Groups all of whose undirected Cayley graphs are determined by their spectra
inferred← citeshttps://doi.org/10.26493/1855-3974.2354.616openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
inferred← citeshttps://doi.org/10.26493/1855-3974.2863.4b9openalex-snapshot
The role of the Axiom of Choice in proper and distinguishing colourings
inferred← citeshttps://doi.org/10.26493/1855-3974.2878.a61openalex-snapshot
On asymmetric colourings of graphs with bounded degrees and infinite motion
inferred← citeshttps://doi.org/10.26493/2590-9770.1395.a37openalex-snapshot
Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
inferred← citeshttps://doi.org/10.26493/2590-9770.1463.f59openalex-snapshot
Paint cost and the frugal distinguishing number
inferred← citeshttps://doi.org/10.26493/2590-9770.1472.24bopenalex-snapshot
Distinguishing arc-colourings of symmetric digraphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1504.f7aopenalex-snapshot
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
inferred← citeshttps://doi.org/10.2989/16073606.2023.2274580openalex-snapshot
The number of distinguishing colorings of a Cartesian product graph
inferred← citeshttps://doi.org/10.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
inferred← citeshttps://doi.org/10.37236/8370openalex-snapshot
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06023openalex-snapshot
Distinguishing number of Urysohn metric spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12101openalex-snapshot
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.09716openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2024.12.1.6openalex-snapshot
Edge-locating coloring of graphs
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.