across | across(g,X,Y) --- find all edges with one end in X and other end in Y. |
add | add --- add edge(s) to the graph |
alpha | [a,S] = alpha(g) --- indepencence number |
bfstree | bfstree(t,g,v) --- create a breadth-first spanning tree of g |
bipartition | part = bipartition(g) --- find bipartition of a bipartite graph |
bipmatch | bipmatch --- maximum matching in a bipartite graph |
bridges | bridges(g,algo) --- find all cut edges in g |
bucky | bucky(g) --- overwrite g with the Buckyball graph (and give a nice |
cartesian | cartesian(g,h1,h2) --- overwrite g with the product of h1 and h2 |
cayley | cayley(g,perms) -- create a Cayley graph (undirected) |
cdraw | cdraw(g,coloring) -- draw g with a given vertex coloring |
chromatic_poly | chrompoly(g) --- find the chromatic polynomial of g |
circulant | circulant(g,n,k) --- overwrite g with an n,k circulant graph |
clear_edges | clear_edges(g) --- delete all edges of g |
clear_labels | clearl_labels(g) --- delete all labels in g |
color | color(g,algo) --- color the graph g by a given algorithm |
complement | graph complement |
complete | complete: build complete and complete multipartite graphs |
component | component(g,v) -- find vertices in v's component of g |
components | components(g) --- find the components of the graph g |
contract | contract(g,u,v) --- contract v into u |
copy | copy(g,h) --- overwrite g with a copy of h |
copy_labels | copy_labels(g,h) --- copy labels from h to g |
cube | cube(g,k) --- create a k-cube (default k = 3) |
cycle | cycle(g,n) --- create a cycle graph on n vertices |
deg | deg: degree of a vertex or degree sequence |
delete | delete --- delete vertices or edges from a graph |
dfstree | dfstree(t,g,v) --- create a depth-first spanning tree of g |
diam | diam(g) --- return the diameter of g: the length of a longest shortest |
disjoint_union | disjoint_union(g,h,k) --- overwrite g with the disjoint union of the |
display | display(g) --- display basic information about a graph object |
dist | dist(g,v,w) and dist(g,v) --- find distance(s) between vertices |
distxy | distxy(g) -- give g a distance based embedding |
dodecahedron | dodecahedron(g) --- overwrite g with the dodecahedron graph |
dom | [d,S] = dom(g) --- domination number of g |
dot | dot(g,filename) --- save graph for use by graphviz. |
draw | draw(g) --- draw g in a figure window |
draw_labels | draw_labels(g) --- add labels to a drawing of g |
edge_color | edge_color(g,algo) --- find a proper edge coloring of the graph g |
edges | edges(g) --- list the edges in g as a 2-column matrix |
embed | embed --- create an embedding for a graph |
eq | yn = eq(g,h) --- check if two graphs are equal (identical) |
euler_trail | euler_trail(g) --- find an euler trail in g (if one exists) |
fast_set_matrix | fast_set_matrix(g,A) --- overwrite the adjacency matrix of g with A |
find_path | find_path(g,u,v) --- find a shortest path from u to v |
free | free(g) --- free the graph from the system |
full | full(g) --- convert internal storage for g to full |
get_label | get_label(g) or get_label(g,v) --- get vertex label(s) |
getxy | getxy(g) --- give g's embedding (or [] if g doesn't have one) |
graffle | graffle(g, filename, width, rad) --- write graph in OmniGraffle format |
graph | graph: constructor for the graph class |
grid | grid(g,a,b) --- create an a-by-b grid graph |
hamiltonian_cycle | hamiltonian_cycle(g) --- find a Hamiltonian cycle in g (if one exists) |
has | has --- check if the graph has a particular vertex or edge |
has_path | has_path(g,u,v) --- determine if there is a path from u to v in g |
hasxy | hasxy(g) --- determine if an embedding has been created for g |
icosahedron | icosahedron(g) --- overwrite g with the icosahedron graph |
incidence_matrix | incidence_matrix(g) --- return the vertex/edge incidence matrix. |
induce | induce --- create induced subgraphs |
intersect | intersect(g,h1,h2) --- g is set to the intersection of h1 and h2. |
interval_graph | interval_graph(g,ilist) --- create an interval graph |
is_labeled | is_labeled(g) --- determine if there are labels on vertices. |
isconnected | isconnected(g) --- test if g is a connected graph |
isfull | isfull(g) --- check if g's adjacency matrix is full |
iso | [yn,p] = iso(g,h,options) --- is g isomorphic to h? |
issparse | issparse(g) --- check if g's adjacency matrix is sparse |
join | join(g,h1,h2) --- overwrite g with the join of h1 and h2 |
label | Assign labels to vertices of g |
laplacian | laplacian(g) --- get the Laplacian matrix of g |
ldraw | ldraw(g,line_style) --- draw a graph with vertices marked with their labels |
line_graph | line_graph(g,h) --- set g to be the line graph of h |
load | load(g,filename) --- read a saved graph on disk |
make_logical | make_logical(g) --- ensure that the internal storage for g's matrix is a |
match_join | match_join(g,h1,h2) --- overwrite g with a graph formed from disjoint |
matrix | matrix(g) --- return (a copy of) the adjacency matrix of g |
mdsxy | mdsxy(g) -- create an embedding based on multidimensional scaling |
mobius | mobius(g,nverts) --- create a Mobius ladder graph |
mycielski | mycielski(g,n) --- create n'th order Mycielski graph (n > 0) |
nauty | nauty(g,filename) -- save a graph in nauty format |
ndraw | ndraw(g) --- draw g in a figure window with numbered vertices |
ne | ne(g) --- number of edges in g or ne(g,h) --- check for inequality |
neighbors | neighbors(g,v) --- neighbors of v as a list. |
nsptrees | nsptrees(g) --- number of spanning trees of g. |
nv | nv(g) --- number of vertices in g |
octahedron | octahedron(g) --- overwrite g with the octahedron graph, K(2,2,2) |
omega | [w,S] = omega(g) --- clique number |
paley | paley(g,n) --- create a Paley graph with n vertices |
path | path(g,n) --- make g a path on n vertices |
petersen | petersen(g) --- overwrite g with the Petersen graph |
prufer | prufer --- convert a tree to/from its Prufer code |
random | random --- overwrite g with a random graph |
random_bipartite | random_bipartite(g,n,m,p) --- create a random bipartite graph |
random_planar | random_planar(g,n) --- create a random planar triangulation |
random_regular | random_regular(g,n,k) --- create a random regular graph |
random_tree | random_tree(t,n) --- overwrite t with a random tree on n vertices |
randxy | randxy(g) --- give g a random embedding in the plane |
renumber | renumber the vertices of a graph |
resistance | R = resistance(g) --- calculate resistances between vertices |
resize | resize(g,n) --- change the number of vertices in g to n |
rmxy | rmxy(g) --- erase g's embedding |
save | save(g,filename) --- save a graph to disk |
scale | scale(g,s) --- rescale the embedding of g by s |
selective | selective(g,n,n0,d) --- selective attachment random graph |
set_matrix | set_matrix(g,A) --- set g to be the graph specificed in the matrix A. |
sgf | sgf --- simple graph format: a 2-column matrix representation |
shiftgraph | shiftgraph(g,k,t) -- create a shiftgraph g based on t-tuples of k symbols |
size | size(g) --- returns [nv,ne] for the graph |
sl2graph | sl2graph(g,p) -- create an SL(2,p) graph |
slot | slot(g) --- slot number occupied by g in GRAPH_MAGIC |
sparse | sparse(g) --- convert internal storage for g to sparse |
split | part = split(g) --- partition the vertices of g into two subsets |
sprandom | sprandom(g,n,p) --- create a sparse random graph |
springxy | springxy(g) --- find a spring embedding of g |
spy | spy(g) --- display the "spy" of g's adjacency matrix |
subsref | subsref implements the notation g(v) and g(v,w) |
thresh | thresh(g,x) -- create a threshold graph |
trim | trim(g,d) --- iteratively remove vertices of degree at most d |
union | union(g,h1,h2) --- set g equal to the union of h1 and h2. |
vertex_degree_sequence | find the degrees of the neighbors of a vertex |
wheel | wheel(g,n) --- overwrite g with a wheel graph on n vertices |