Binary Graph Labelings and Linear Preservers
Copyright policy )Binary Graph Labelings and Linear Preservers
An FM labeling of the vertices of an undirected graph requires that half the neighbors of each vertex are labeled zero and the other half labeled one. Variations of this type of labeling are presented and examples of the smallest and largest of graphs having one of these FM labelings are given. It is also shown that if $T$ is a linear operator on the set of all undirected graphs on $n$ vertices that strongly preserves sets of graphs that are labelable by one of the various FM type labelings, then $T$ is a vertex permutation.
- Utah State University United States
Graph labelling (graceful graphs, bandwidth, etc.), Graphs and linear algebra (matrices, eigenvalues, etc.), binary vertex labeling, Freyberg-Marr labeling, linear operator, Linear preserver problems, vertex permutation
Graph labelling (graceful graphs, bandwidth, etc.), Graphs and linear algebra (matrices, eigenvalues, etc.), binary vertex labeling, Freyberg-Marr labeling, linear operator, Linear preserver problems, vertex permutation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!