St000081Graphs ⟶ ℤ
The number of edges of a graph.
St000086Graphs ⟶ ℤ
The number of subgraphs.
St000087Graphs ⟶ ℤ
The number of induced subgraphs.
St000093Graphs ⟶ ℤ
The cardinality of a maximal independent set of vertices of a graph.
St000095Graphs ⟶ ℤ
The number of triangles of a graph.
St000096Graphs ⟶ ℤ
The number of spanning trees of a graph.
St000097Graphs ⟶ ℤ
The order of the largest clique of the graph.
St000098Graphs ⟶ ℤ
The chromatic number of a graph.
St000171Graphs ⟶ ℤ
The degree of the graph.
St000172Graphs ⟶ ℤ
The Grundy number of a graph.
St000244Graphs ⟶ ℤ
The cardinality of the automorphism group of a graph.
St000258Graphs ⟶ ℤ
The burning number of a graph.
St000259Graphs ⟶ ℤ
The diameter of a connected graph.
St000260Graphs ⟶ ℤ
The radius of a connected graph.
St000261Graphs ⟶ ℤ
The edge connectivity of a graph.
St000262Graphs ⟶ ℤ
The vertex connectivity of a graph.
St000263Graphs ⟶ ℤ
The Szeged index of a graph.
St000264Graphs ⟶ ℤ
The girth of a graph, which is not a tree.
St000265Graphs ⟶ ℤ
The Wiener index of a graph.
St000266Graphs ⟶ ℤ
The number of spanning subgraphs of a graph with the same connected components.
St000267Graphs ⟶ ℤ
The number of maximal spanning forests contained in a graph.
St000268Graphs ⟶ ℤ
The number of strongly connected orientations of a graph.
St000269Graphs ⟶ ℤ
The number of acyclic orientations of a graph.
St000270Graphs ⟶ ℤ
The number of forests contained in a graph.
St000271Graphs ⟶ ℤ
The chromatic index of a graph.
St000272Graphs ⟶ ℤ
The treewidth of a graph.
St000273Graphs ⟶ ℤ
The domination number of a graph.
St000274Graphs ⟶ ℤ
The number of perfect matchings of a graph.
St000276Graphs ⟶ ℤ
The size of the preimage of the map 'to graph' from Ordered trees to Graphs.
St000283Graphs ⟶ ℤ
The size of the preimage of the map 'to graph' from Binary trees to Graphs.
St000286Graphs ⟶ ℤ
The number of connected components of the complement of a graph.
St000287Graphs ⟶ ℤ
The number of connected components of a graph.
St000299Graphs ⟶ ℤ
The number of nonisomorphic vertex-induced subtrees.
St000300Graphs ⟶ ℤ
The number of independent sets of vertices of a graph.
St000301Graphs ⟶ ℤ
The number of facets of the stable set polytope of a graph.
St000302Graphs ⟶ ℤ
The determinant of the distance matrix of a connected graph.
St000303Graphs ⟶ ℤ
The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$.
St000309Graphs ⟶ ℤ
The number of vertices with even degree.
St000310Graphs ⟶ ℤ
The minimal degree of a vertex of a graph.
St000311Graphs ⟶ ℤ
The number of vertices of odd degree in a graph.
St000312Graphs ⟶ ℤ
The number of leaves in a graph.
St000313Graphs ⟶ ℤ
The number of degree 2 vertices of a graph.
St000315Graphs ⟶ ℤ
The number of isolated vertices of a graph.
St000322Graphs ⟶ ℤ
The skewness of a graph.
St000323Graphs ⟶ ℤ
The minimal crossing number of a graph.
St000343Graphs ⟶ ℤ
The number of spanning subgraphs of a graph.
St000344Graphs ⟶ ℤ
The number of strongly connected outdegree sequences of a graph.
St000349Graphs ⟶ ℤ
The number of different adjacency matrices of a graph.
St000350Graphs ⟶ ℤ
The sum of the vertex degrees of a graph.
St000351Graphs ⟶ ℤ
The determinant of the adjacency matrix of a graph.
St000361Graphs ⟶ ℤ
The second Zagreb index of a graph.
St000362Graphs ⟶ ℤ
The size of a minimal vertex cover of a graph.
St000363Graphs ⟶ ℤ
The number of minimal vertex covers of a graph.
St000364Graphs ⟶ ℤ
The exponent of the automorphism group of a graph.
St000368Graphs ⟶ ℤ
The Altshuler-Steinberg determinant of a graph.
St000370Graphs ⟶ ℤ
The genus of a graph.
St000379Graphs ⟶ ℤ
The number of Hamiltonian cycles in a graph.
St000387Graphs ⟶ ℤ
The matching number of a graph.
St000388Graphs ⟶ ℤ
The number of orbits of vertices of a graph under automorphisms.
St000403Graphs ⟶ ℤ
The Szeged index minus the Wiener index of a graph.
St000422Graphs ⟶ ℤ
The energy of a graph, if it is integral.
St000447Graphs ⟶ ℤ
The number of pairs of vertices of a graph with distance 3.
St000448Graphs ⟶ ℤ
The number of pairs of vertices of a graph with distance 2.
St000449Graphs ⟶ ℤ
The number of pairs of vertices of a graph with distance 4.
St000450Graphs ⟶ ℤ
The number of edges minus the number of vertices plus 2 of a graph.
St000452Graphs ⟶ ℤ
The number of distinct eigenvalues of a graph.
St000453Graphs ⟶ ℤ
The number of distinct Laplacian eigenvalues of a graph.
St000454Graphs ⟶ ℤ
The largest eigenvalue of a graph if it is integral.
St000455Graphs ⟶ ℤ
The second largest eigenvalue of a graph if it is integral.
St000456Graphs ⟶ ℤ
The monochromatic index of a connected graph.
St000464Graphs ⟶ ℤ
The Schultz index of a connected graph.
St000465Graphs ⟶ ℤ
The first Zagreb index of a graph.
St000466Graphs ⟶ ℤ
The Gutman (or modified Schultz) index of a connected graph.
St000467Graphs ⟶ ℤ
The hyper-Wiener index of a connected graph.
St000468Graphs ⟶ ℤ
The Hosoya index of a graph.
St000469Graphs ⟶ ℤ
The distinguishing number of a graph.
St000479Graphs ⟶ ℤ
The Ramsey number of a graph.
St000482Graphs ⟶ ℤ
The (zero)-forcing number of a graph.
St000535Graphs ⟶ ℤ
The rank-width of a graph.
St000536Graphs ⟶ ℤ
The pathwidth of a graph.
St000537Graphs ⟶ ℤ
The cutwidth of a graph.
St000544Graphs ⟶ ℤ
The cop number of a graph.
St000552Graphs ⟶ ℤ
The number of cut vertices of a graph.
St000553Graphs ⟶ ℤ
The number of blocks of a graph.
St000571Graphs ⟶ ℤ
The F-index (or forgotten topological index) of a graph.
St000636Graphs ⟶ ℤ
The hull number of a graph.
St000637Graphs ⟶ ℤ
The length of the longest cycle in a graph.
St000671Graphs ⟶ ℤ
The maximin edge-connectivity for choosing a subgraph.
St000699Graphs ⟶ ℤ
The toughness times the least common multiple of 1,.
St000718Graphs ⟶ ℤ
The largest Laplacian eigenvalue of a graph if it is integral.
St000722Graphs ⟶ ℤ
The number of different neighbourhoods in a graph.
St000723Graphs ⟶ ℤ
The maximal cardinality of a set of vertices with the same neighbourhood in a graph.
St000741Graphs ⟶ ℤ
The Colin de Verdière graph invariant.
St000771Graphs ⟶ ℤ
The largest multiplicity of a distance Laplacian eigenvalue in a connected graph.
St000772Graphs ⟶ ℤ
The multiplicity of the largest distance Laplacian eigenvalue in a connected graph.
St000773Graphs ⟶ ℤ
The multiplicity of the largest Laplacian eigenvalue in a graph.
St000774Graphs ⟶ ℤ
The maximal multiplicity of a Laplacian eigenvalue in a graph.
St000775Graphs ⟶ ℤ
The multiplicity of the largest eigenvalue in a graph.
St000776Graphs ⟶ ℤ
The maximal multiplicity of an eigenvalue in a graph.
St000777Graphs ⟶ ℤ
The number of distinct eigenvalues of the distance Laplacian of a connected graph.
St000778Graphs ⟶ ℤ
The metric dimension of a graph.
St000785Graphs ⟶ ℤ
The number of distinct colouring schemes of a graph.
St000786Graphs ⟶ ℤ
The maximal number of occurrences of a colour in a proper colouring of a graph.
St000822Graphs ⟶ ℤ
The Hadwiger number of the graph.
St000915Graphs ⟶ ℤ
The Ore degree of a graph.
St000916Graphs ⟶ ℤ
The packing number of a graph.
St000917Graphs ⟶ ℤ
The open packing number of a graph.
St000918Graphs ⟶ ℤ
The 2-limited packing number of a graph.
St000926Graphs ⟶ ℤ
The clique-coclique number of a graph.
St000948Graphs ⟶ ℤ
The chromatic discriminant of a graph.
St000972Graphs ⟶ ℤ
The composition number of a graph.
St000985Graphs ⟶ ℤ
The number of positive eigenvalues of the adjacency matrix of the graph.
St000986Graphs ⟶ ℤ
The multiplicity of the eigenvalue zero of the adjacency matrix of the graph.
St000987Graphs ⟶ ℤ
The number of positive eigenvalues of the Laplacian matrix of the graph.
St001029Graphs ⟶ ℤ
The size of the core of a graph.
St001056Graphs ⟶ ℤ
The Grundy value for the game of deleting vertices of a graph until it has no edges.
St001057Graphs ⟶ ℤ
The Grundy value of the game of creating an independent set in a graph.
St001060Graphs ⟶ ℤ
The distinguishing index of a graph.
St001069Graphs ⟶ ℤ
The coefficient of the monomial xy of the Tutte polynomial of the graph.
St001070Graphs ⟶ ℤ
The absolute value of the derivative of the chromatic polynomial of the graph at 1.
St001071Graphs ⟶ ℤ
The beta invariant of the graph.
St001072Graphs ⟶ ℤ
The evaluation of the Tutte polynomial of the graph at x and y equal to 3.
St001073Graphs ⟶ ℤ
The number of nowhere zero 3-flows of a graph.
St001093Graphs ⟶ ℤ
The detour number of a graph.
St001108Graphs ⟶ ℤ
The 2-dynamic chromatic number of a graph.
St001109Graphs ⟶ ℤ
The number of proper colourings of a graph with as few colours as possible.
St001110Graphs ⟶ ℤ
The 3-dynamic chromatic number of a graph.
St001111Graphs ⟶ ℤ
The weak 2-dynamic chromatic number of a graph.
St001112Graphs ⟶ ℤ
The 3-weak dynamic number of a graph.
St001116Graphs ⟶ ℤ
The game chromatic number of a graph.
St001117Graphs ⟶ ℤ
The game chromatic index of a graph.
St001118Graphs ⟶ ℤ
The acyclic chromatic index of a graph.
St001119Graphs ⟶ ℤ
The length of a shortest maximal path in a graph.
St001120Graphs ⟶ ℤ
The length of a longest path in a graph.
St001261Graphs ⟶ ℤ
The Castelnuovo-Mumford regularity of a graph.
St001270Graphs ⟶ ℤ
The bandwidth of a graph.
St001271Graphs ⟶ ℤ
The competition number of a graph.
St001272Graphs ⟶ ℤ
The number of graphs with the same degree sequence.
St001277Graphs ⟶ ℤ
The degeneracy of a graph.
St001281Graphs ⟶ ℤ
The normalized isoperimetric number of a graph.
St001282Graphs ⟶ ℤ
The number of graphs with the same chromatic polynomial.
St001286Graphs ⟶ ℤ
The annihilation number of a graph.
St001302Graphs ⟶ ℤ
The number of minimally dominating sets of vertices of a graph.
St001303Graphs ⟶ ℤ
The number of dominating sets of vertices of a graph.
St001304Graphs ⟶ ℤ
The number of maximally independent sets of vertices of a graph.
St001305Graphs ⟶ ℤ
The number of induced cycles on four vertices in a graph.
St001306Graphs ⟶ ℤ
The number of induced paths on four vertices in a graph.
St001307Graphs ⟶ ℤ
The number of induced stars on four vertices in a graph.
St001308Graphs ⟶ ℤ
The number of induced paths on three vertices in a graph.
St001309Graphs ⟶ ℤ
The number of four-cliques in a graph.
St001310Graphs ⟶ ℤ
The number of induced diamond graphs in a graph.
St001311Graphs ⟶ ℤ
The cyclomatic number of a graph.
St001315Graphs ⟶ ℤ
The dissociation number of a graph.
St001316Graphs ⟶ ℤ
The domatic number of a graph.
St001317Graphs ⟶ ℤ
The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph.
St001318Graphs ⟶ ℤ
The number of vertices of the largest induced subforest with the same number of connected components of a graph.
St001319Graphs ⟶ ℤ
The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph.
St001320Graphs ⟶ ℤ
The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph.
St001321Graphs ⟶ ℤ
The number of vertices of the largest induced subforest of a graph.
St001322Graphs ⟶ ℤ
The size of a minimal independent dominating set in a graph.
St001323Graphs ⟶ ℤ
The independence gap of a graph.
St001324Graphs ⟶ ℤ
The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph.
St001325Graphs ⟶ ℤ
The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph.
St001326Graphs ⟶ ℤ
The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph.
St001327Graphs ⟶ ℤ
The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph.
St001328Graphs ⟶ ℤ
The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph.
St001329Graphs ⟶ ℤ
The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph.
St001330Graphs ⟶ ℤ
The hat guessing number of a graph.
St001331Graphs ⟶ ℤ
The size of the minimal feedback vertex set.
St001333Graphs ⟶ ℤ
The cardinality of a minimal edge-isolating set of a graph.
St001334Graphs ⟶ ℤ
The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph.
St001335Graphs ⟶ ℤ
The cardinality of a minimal cycle-isolating set of a graph.
St001336Graphs ⟶ ℤ
The minimal number of vertices in a graph whose complement is triangle-free.
St001337Graphs ⟶ ℤ
The upper domination number of a graph.
St001338Graphs ⟶ ℤ
The upper irredundance number of a graph.
St001339Graphs ⟶ ℤ
The irredundance number of a graph.
St001340Graphs ⟶ ℤ
The cardinality of a minimal non-edge isolating set of a graph.
St001341Graphs ⟶ ℤ
The number of edges in the center of a graph.
St001342Graphs ⟶ ℤ
The number of vertices in the center of a graph.
St001345Graphs ⟶ ℤ
The Hamming dimension of a graph.
St001347Graphs ⟶ ℤ
The number of pairs of vertices of a graph having the same neighbourhood.
St001349Graphs ⟶ ℤ
The number of different graphs obtained from the given graph by removing an edge.
St001350Graphs ⟶ ℤ
Half of the Albertson index of a graph.
St001351Graphs ⟶ ℤ
The Albertson index of a graph.
St001352Graphs ⟶ ℤ
The number of internal nodes in the modular decomposition of a graph.
St001353Graphs ⟶ ℤ
The number of prime nodes in the modular decomposition of a graph.
St001354Graphs ⟶ ℤ
The number of series nodes in the modular decomposition of a graph.
St001356Graphs ⟶ ℤ
The number of vertices in prime modules of a graph.
St001357Graphs ⟶ ℤ
The maximal degree of a regular spanning subgraph of a graph.
St001358Graphs ⟶ ℤ
The largest degree of a regular subgraph of a graph.
St001362Graphs ⟶ ℤ
The normalized Knill dimension of a graph.
St001363Graphs ⟶ ℤ
The Euler characteristic of a graph according to Knill.
St001366Graphs ⟶ ℤ
The maximal multiplicity of a degree of a vertex of a graph.
St001367Graphs ⟶ ℤ
The smallest number which does not occur as degree of a vertex in a graph.
St001368Graphs ⟶ ℤ
The number of vertices of maximal degree in a graph.
St001373Graphs ⟶ ℤ
The logarithm of the number of winning configurations of the lights out game on a graph.
St001374Graphs ⟶ ℤ
The Padmakar-Ivan index of a graph.
St001386Graphs ⟶ ℤ
The number of prime labellings of a graph.
St001391Graphs ⟶ ℤ
The disjunction number of a graph.
St001393Graphs ⟶ ℤ
The induced matching number of a graph.
St001395Graphs ⟶ ℤ
The number of strictly unfriendly partitions of a graph.
St001441Graphs ⟶ ℤ
The number of non-empty connected induced subgraphs of a graph.
St001458Graphs ⟶ ℤ
The rank of the adjacency matrix of a graph.
St001459Graphs ⟶ ℤ
The number of zero columns in the nullspace of a graph.
St001463Graphs ⟶ ℤ
The number of distinct columns in the nullspace of a graph.
St001474Graphs ⟶ ℤ
The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1).
St001475Graphs ⟶ ℤ
The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0).
St001476Graphs ⟶ ℤ
The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1).
St001477Graphs ⟶ ℤ
The number of nowhere zero 5-flows of a graph.
St001478Graphs ⟶ ℤ
The number of nowhere zero 4-flows of a graph.
St001479Graphs ⟶ ℤ
The number of bridges of a graph.
St001494Graphs ⟶ ℤ
The Alon-Tarsi number of a graph.
St001496Graphs ⟶ ℤ
The number of graphs with the same Laplacian spectrum as the given graph.
St001512Graphs ⟶ ℤ
The minimum rank of a graph.
St001518Graphs ⟶ ℤ
The number of graphs with the same ordinary spectrum as the given graph.
St001521Graphs ⟶ ℤ
Half the total irregularity of a graph.
St001522Graphs ⟶ ℤ
The total irregularity of a graph.
St001545Graphs ⟶ ℤ
The second Elser number of a connected graph.
St001546Graphs ⟶ ℤ
The number of monomials in the Tutte polynomial of a graph.
St001570Graphs ⟶ ℤ
The minimal number of edges to add to make a graph Hamiltonian.
St001572Graphs ⟶ ℤ
The minimal number of edges to remove to make a graph bipartite.
St001573Graphs ⟶ ℤ
The minimal number of edges to remove to make a graph triangle-free.
St001574Graphs ⟶ ℤ
The minimal number of edges to add or remove to make a graph regular.
St001575Graphs ⟶ ℤ
The minimal number of edges to add or remove to make a graph edge transitive.
St001576Graphs ⟶ ℤ
The minimal number of edges to add or remove to make a graph vertex transitive.
St001577Graphs ⟶ ℤ
The minimal number of edges to add or remove to make a graph a cograph.
St001578Graphs ⟶ ℤ
The minimal number of edges to add or remove to make a graph a line graph.
St001580Graphs ⟶ ℤ
The acyclic chromatic number of a graph.
St001581Graphs ⟶ ℤ
The achromatic number of a graph.
St001592Graphs ⟶ ℤ
The maximal number of simple paths between any two different vertices of a graph.
St001638Graphs ⟶ ℤ
The book thickness of a graph.
St001642Graphs ⟶ ℤ
The Prague dimension of a graph.
St001644Graphs ⟶ ℤ
The dimension of a graph.
St001645Graphs ⟶ ℤ
The pebbling number of a connected graph.
St001646Graphs ⟶ ℤ
The number of edges that can be added without increasing the maximal degree of a graph.
St001647Graphs ⟶ ℤ
The number of edges that can be added without increasing the clique number.
St001648Graphs ⟶ ℤ
The number of edges that can be added without increasing the chromatic number.
St001649Graphs ⟶ ℤ
The length of a longest trail in a graph.
St001654Graphs ⟶ ℤ
The monophonic hull number of a graph.
St001655Graphs ⟶ ℤ
The general position number of a graph.
St001656Graphs ⟶ ℤ
The monophonic position number of a graph.
St001670Graphs ⟶ ℤ
The connected partition number of a graph.
St001672Graphs ⟶ ℤ
The restrained domination number of a graph.
St001674Graphs ⟶ ℤ
The number of vertices of the largest induced star graph in the graph.
St001689Graphs ⟶ ℤ
The number of celebrities in a graph.
St001690Graphs ⟶ ℤ
The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path.
St001691Graphs ⟶ ℤ
The number of kings in a graph.
St001692Graphs ⟶ ℤ
The number of vertices with higher degree than the average degree in a graph.
St001694Graphs ⟶ ℤ
The number of maximal dissociation sets in a graph.
St001702Graphs ⟶ ℤ
The absolute value of the determinant of the adjacency matrix of a graph.
St001703Graphs ⟶ ℤ
The villainy of a graph.
St001704Graphs ⟶ ℤ
The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph.
St001706Graphs ⟶ ℤ
The number of closed sets in a graph.
St001707Graphs ⟶ ℤ
The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them.
St001708Graphs ⟶ ℤ
The number of pairs of vertices of different degree in a graph.
St001716Graphs ⟶ ℤ
The 1-improper chromatic number of a graph.
St001723Graphs ⟶ ℤ
The differential of a graph.
St001724Graphs ⟶ ℤ
The 2-packing differential of a graph.
St001725Graphs ⟶ ℤ
The harmonious chromatic number of a graph.
St001734Graphs ⟶ ℤ
The lettericity of a graph.
St001736Graphs ⟶ ℤ
The total number of cycles in a graph.
St001738Graphs ⟶ ℤ
The minimal order of a graph which is not an induced subgraph of the given graph.
St001739Graphs ⟶ ℤ
The number of graphs with the same edge polytope as the given graph.
St001740Graphs ⟶ ℤ
The number of graphs with the same symmetric edge polytope as the given graph.
St001742Graphs ⟶ ℤ
The difference of the maximal and the minimal degree in a graph.
St001743Graphs ⟶ ℤ
The discrepancy of a graph.
St001746Graphs ⟶ ℤ
The coalition number of a graph.
St001757Graphs ⟶ ℤ
The number of orbits of toric promotion on a graph.
St001758Graphs ⟶ ℤ
The number of orbits of promotion on a graph.
St001762Graphs ⟶ ℤ
The number of convex subsets of vertices in a graph.
St001764Graphs ⟶ ℤ
The number of non-convex subsets of vertices in a graph.
St001765Graphs ⟶ ℤ
The number of connected components of the friends and strangers graph.
St001774Graphs ⟶ ℤ
The degree of the minimal polynomial of the smallest eigenvalue of a graph.
St001775Graphs ⟶ ℤ
The degree of the minimal polynomial of the largest eigenvalue of a graph.
St001776Graphs ⟶ ℤ
The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph.
St001783Graphs ⟶ ℤ
The number of odd automorphisms of a graph.
St001792Graphs ⟶ ℤ
The arboricity of a graph.
St001793Graphs ⟶ ℤ
The difference between the clique number and the chromatic number of a graph.
St001794Graphs ⟶ ℤ
Half the number of sets of vertices in a graph which are dominating and non-blocking.
St001795Graphs ⟶ ℤ
The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1).
St001796Graphs ⟶ ℤ
The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1).
St001797Graphs ⟶ ℤ
The number of overfull subgraphs of a graph.
St001798Graphs ⟶ ℤ
The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph.
St001799Graphs ⟶ ℤ
The number of proper separations of a graph.
St001802Graphs ⟶ ℤ
The number of endomorphisms of a graph.
St001812Graphs ⟶ ℤ
The biclique partition number of a graph.
St001826Graphs ⟶ ℤ
The maximal number of leaves on a vertex of a graph.
St001827Graphs ⟶ ℤ
The number of two-component spanning forests of a graph.
St001828Graphs ⟶ ℤ
The Euler characteristic of a graph.
St001829Graphs ⟶ ℤ
The common independence number of a graph.
St001834Graphs ⟶ ℤ
The number of non-isomorphic minors of a graph.
St001844Graphs ⟶ ℤ
The maximal degree of a generator of the invariant ring of the automorphism group of a graph.
St001869Graphs ⟶ ℤ
The maximum cut size of a graph.
St001871Graphs ⟶ ℤ
The number of triconnected components of a graph.
St001883Graphs ⟶ ℤ
The mutual visibility number of a graph.
St001917Graphs ⟶ ℤ
The order of toric promotion on the set of labellings of a graph.