Enumeration of point-determining graphs |
| |
Authors: | Ira M Gessel |
| |
Institution: | a Department of Mathematics, Brandeis University, MS 050, Waltham, MA 02454-9110, United States b Department of Mathematics, The University of Arizona, 617 N. Santa Rita Ave., Tucson, AZ 85721-0089, United States |
| |
Abstract: | Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-determining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases. |
| |
Keywords: | Graphical enumeration Point-determining Combinatorial species Graphs without endpoints Superimposition of graphs |
本文献已被 ScienceDirect 等数据库收录! |
|