< Master index Index for matgraph/@graph >

Index for matgraph/@graph

Matlab files in this directory:

 acrossacross(g,X,Y) --- find all edges with one end in X and other end in Y.
 addadd --- add edge(s) to the graph
 alpha[a,S] = alpha(g) --- indepencence number
 bfstreebfstree(t,g,v) --- create a breadth-first spanning tree of g
 bipartitionpart = bipartition(g) --- find bipartition of a bipartite graph
 bipmatchbipmatch --- maximum matching in a bipartite graph
 bridgesbridges(g,algo) --- find all cut edges in g
 buckybucky(g) --- overwrite g with the Buckyball graph (and give a nice
 cartesiancartesian(g,h1,h2) --- overwrite g with the product of h1 and h2
 cayleycayley(g,perms) -- create a Cayley graph (undirected)
 cdrawcdraw(g,coloring) -- draw g with a given vertex coloring
 chromatic_polychrompoly(g) --- find the chromatic polynomial of g
 circulantcirculant(g,n,k) --- overwrite g with an n,k circulant graph
 clear_edgesclear_edges(g) --- delete all edges of g
 clear_labelsclearl_labels(g) --- delete all labels in g
 colorcolor(g,algo) --- color the graph g by a given algorithm
 complementgraph complement
 completecomplete: build complete and complete multipartite graphs
 componentcomponent(g,v) -- find vertices in v's component of g
 componentscomponents(g) --- find the components of the graph g
 contractcontract(g,u,v) --- contract v into u
 copycopy(g,h) --- overwrite g with a copy of h
 copy_labelscopy_labels(g,h) --- copy labels from h to g
 cubecube(g,k) --- create a k-cube (default k = 3)
 cyclecycle(g,n) --- create a cycle graph on n vertices
 degdeg: degree of a vertex or degree sequence
 deletedelete --- delete vertices or edges from a graph
 dfstreedfstree(t,g,v) --- create a depth-first spanning tree of g
 diamdiam(g) --- return the diameter of g: the length of a longest shortest
 disjoint_uniondisjoint_union(g,h,k) --- overwrite g with the disjoint union of the
 displaydisplay(g) --- display basic information about a graph object
 distdist(g,v,w) and dist(g,v) --- find distance(s) between vertices
 distxydistxy(g) -- give g a distance based embedding
 dodecahedrondodecahedron(g) --- overwrite g with the dodecahedron graph
 dom[d,S] = dom(g) --- domination number of g
 dotdot(g,filename) --- save graph for use by graphviz.
 drawdraw(g) --- draw g in a figure window
 draw_labelsdraw_labels(g) --- add labels to a drawing of g
 edge_coloredge_color(g,algo) --- find a proper edge coloring of the graph g
 edgesedges(g) --- list the edges in g as a 2-column matrix
 embedembed --- create an embedding for a graph
 eqyn = eq(g,h) --- check if two graphs are equal (identical)
 euler_traileuler_trail(g) --- find an euler trail in g (if one exists)
 fast_set_matrixfast_set_matrix(g,A) --- overwrite the adjacency matrix of g with A
 find_pathfind_path(g,u,v) --- find a shortest path from u to v
 freefree(g) --- free the graph from the system
 fullfull(g) --- convert internal storage for g to full
 get_labelget_label(g) or get_label(g,v) --- get vertex label(s)
 getxygetxy(g) --- give g's embedding (or [] if g doesn't have one)
 grafflegraffle(g, filename, width, rad) --- write graph in OmniGraffle format
 graphgraph: constructor for the graph class
 gridgrid(g,a,b) --- create an a-by-b grid graph
 hamiltonian_cyclehamiltonian_cycle(g) --- find a Hamiltonian cycle in g (if one exists)
 hashas --- check if the graph has a particular vertex or edge
 has_pathhas_path(g,u,v) --- determine if there is a path from u to v in g
 hasxyhasxy(g) --- determine if an embedding has been created for g
 icosahedronicosahedron(g) --- overwrite g with the icosahedron graph
 incidence_matrixincidence_matrix(g) --- return the vertex/edge incidence matrix.
 induceinduce --- create induced subgraphs
 intersectintersect(g,h1,h2) --- g is set to the intersection of h1 and h2.
 interval_graphinterval_graph(g,ilist) --- create an interval graph
 is_labeledis_labeled(g) --- determine if there are labels on vertices.
 isconnectedisconnected(g) --- test if g is a connected graph
 isfullisfull(g) --- check if g's adjacency matrix is full
 iso[yn,p] = iso(g,h,options) --- is g isomorphic to h?
 issparseissparse(g) --- check if g's adjacency matrix is sparse
 joinjoin(g,h1,h2) --- overwrite g with the join of h1 and h2
 labelAssign labels to vertices of g
 laplacianlaplacian(g) --- get the Laplacian matrix of g
 ldrawldraw(g,line_style) --- draw a graph with vertices marked with their labels
 line_graphline_graph(g,h) --- set g to be the line graph of h
 loadload(g,filename) --- read a saved graph on disk
 make_logicalmake_logical(g) --- ensure that the internal storage for g's matrix is a
 match_joinmatch_join(g,h1,h2) --- overwrite g with a graph formed from disjoint
 matrixmatrix(g) --- return (a copy of) the adjacency matrix of g
 mdsxymdsxy(g) -- create an embedding based on multidimensional scaling
 mobiusmobius(g,nverts) --- create a Mobius ladder graph
 mycielskimycielski(g,n) --- create n'th order Mycielski graph (n > 0)
 nautynauty(g,filename) -- save a graph in nauty format
 ndrawndraw(g) --- draw g in a figure window with numbered vertices
 nene(g) --- number of edges in g or ne(g,h) --- check for inequality
 neighborsneighbors(g,v) --- neighbors of v as a list.
 nsptreesnsptrees(g) --- number of spanning trees of g.
 nvnv(g) --- number of vertices in g
 octahedronoctahedron(g) --- overwrite g with the octahedron graph, K(2,2,2)
 omega[w,S] = omega(g) --- clique number
 paleypaley(g,n) --- create a Paley graph with n vertices
 pathpath(g,n) --- make g a path on n vertices
 petersenpetersen(g) --- overwrite g with the Petersen graph
 pruferprufer --- convert a tree to/from its Prufer code
 randomrandom --- overwrite g with a random graph
 random_bipartiterandom_bipartite(g,n,m,p) --- create a random bipartite graph
 random_planarrandom_planar(g,n) --- create a random planar triangulation
 random_regularrandom_regular(g,n,k) --- create a random regular graph
 random_treerandom_tree(t,n) --- overwrite t with a random tree on n vertices
 randxyrandxy(g) --- give g a random embedding in the plane
 renumberrenumber the vertices of a graph
 resistanceR = resistance(g) --- calculate resistances between vertices
 resizeresize(g,n) --- change the number of vertices in g to n
 rmxyrmxy(g) --- erase g's embedding
 savesave(g,filename) --- save a graph to disk
 scalescale(g,s) --- rescale the embedding of g by s
 selectiveselective(g,n,n0,d) --- selective attachment random graph
 set_matrixset_matrix(g,A) --- set g to be the graph specificed in the matrix A.
 sgfsgf --- simple graph format: a 2-column matrix representation
 shiftgraphshiftgraph(g,k,t) -- create a shiftgraph g based on t-tuples of k symbols
 sizesize(g) --- returns [nv,ne] for the graph
 sl2graphsl2graph(g,p) -- create an SL(2,p) graph
 slotslot(g) --- slot number occupied by g in GRAPH_MAGIC
 sparsesparse(g) --- convert internal storage for g to sparse
 splitpart = split(g) --- partition the vertices of g into two subsets
 sprandomsprandom(g,n,p) --- create a sparse random graph
 springxyspringxy(g) --- find a spring embedding of g
 spyspy(g) --- display the "spy" of g's adjacency matrix
 subsrefsubsref implements the notation g(v) and g(v,w)
 threshthresh(g,x) -- create a threshold graph
 trimtrim(g,d) --- iteratively remove vertices of degree at most d
 unionunion(g,h1,h2) --- set g equal to the union of h1 and h2.
 vertex_degree_sequencefind the degrees of the neighbors of a vertex
 wheelwheel(g,n) --- overwrite g with a wheel graph on n vertices

Subsequent directories:


Generated on Thu 13-Mar-2008 14:23:49 by m2html © 2003