MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
OutdegreeDegreeInedgeDirected edgeOutedgeOrderSizeCodegreeVertexDirected graphBetweennessDigraphIndependence numberValencyDegree sequenceEdgePath lengthNeighborhoodEdge setLineRegular graphDirected pathDicycleClosenessCircumferenceConnected graphClique numberIndependent setDipathAdjacency matrixUndirected graphIncidence functionArrowGraphEdge covering numberHypergraphMatchingGraph toughnessLoose edgeCovering numberCircuit rankHyperedgeHyperarcAssortativityEdge coverDiameterConnectivityDigirthTournamentKingUtility graphSpider graphHalf-edgeEmpty graphWeighted graphBiadjacencyDomination numberComplete graphVertex coverOre's theoremMatching numberPathwidthCrown graphGraph theoryEndpointUltragraphCentralityGirthNodeOutbranchTopological sortDominating setIsthmusAdjacency listBreadthTermgraphReachabilityDesargues graphRooted treeLine graphDigonEdge listLaplacian matrixPredecessorMoore graphBigraphPathLoopCrossingDominatorChordPseudographIncidence matrixDiagonalityTreeHypernodeCutwidthPseudo-edgeHoleMultidigraph