With an increasing popularity of graph data and graph processing systems, the need of efficient graph processing and graph query optimization becomes more important. Subgraph isomorphism queries, one of the fundamental graph query types, rely on an accurate cardinality estimation of a single edge of a pattern for efficient query processing. State of the art approaches do not consider two important aspects for cardinality estimation of graph queries on property graphs: the existence of nodes with a high outdegree and functional dependencies between attributes. In this paper we focus on these two challenges and integrate the detection of high-outdegree nodes and functional dependency analysis into the cardinality estimation. We evaluate our approach on two real data sets and compare it against a state-of-the-art query optimizer for property graphs as implemented in NEO4J.