1+2

10/3

N[10/3,100]

A={1,2,3,4,5}

x=2

3+x

x=7

f[x_]:=x^2

π

N[π]

N[π,100]

4!

1000!

f[x]

f'[x_]

Solve[-a x^2+3x+15==0,x]

a=3

x=.

Plot[f[x],{x,-10,10}]

f[x_,y_]:=x^2+y^2

Plot3D[f[x,y],{x,-10,9}, {y,-8,11}]

A={1,2,3,4}

Subsets[A]

Subsets[A,3]

Length[A]

G=Graph[{1\[UndirectedEdge]2,2\[UndirectedEdge]3,3\[UndirectedEdge]4,2\[UndirectedEdge]4}]

G=VertexAdd[G,5]

G=EdgeAdd[G, {5\[UndirectedEdge]1,5\[UndirectedEdge]3}]

G=VertexDelete[G,5]

G=EdgeDelete[G,2\[UndirectedEdge]3]

G=EdgeAdd[G,2\[UndirectedEdge]3]

V=VertexList[G]

AdjacencyList[G,2]

AdjacencyMatrix[G] // MatrixForm

GraphPlot[G, VertexLabeling->True]

GraphPlot[G, VertexLabeling->True]

Export["grafo.gv", G]

Export["grafo.graphml", G]

H=Import["grafo.gv"]

G=CompleteGraph[17]

GraphPlot[CompleteGraph[{4,3,6,19}],VertexLabeling->True]

G=RandomGraph[{10,32}]

G=CycleGraph[7]

G=StarGraph[7]

G=WheelGraph[27]

G=RandomGraph[{7,17}]

CompleteGraphQ[G]

PlanarGraphQ[G]

PlanarGraphQ[CompleteGraph[4]]

G=AdjacencyGraph[{{0,1,0},{0,0,1},{1,0,0}}]

G=RandomGraph[{17,35}]

GraphDiameter[G]

GraphRadius[G]

GraphCenter[G]

GraphPlot[G,VertexLabeling->True]

ConnectedGraphQ[G]

EulerianGraphQ[G]

G=EdgeDelete[G,10\[UndirectedEdge]16]

G=VertexDelete[G,16]

HamiltonianGraphQ[G]

FindHamiltonianCycle[G]

HighlightGraph[G,FindHamiltonianCycle[G],GraphHighlightStyle->"Thick"]

FindSpanningTree[G]

HighlightGraph[G,FindSpanningTree[G],GraphHighlightStyle->"Thick"]

GraphPlot[HighlightGraph[G,FindSpanningTree[G],GraphHighlightStyle->"Dotted"],VertexLabeling->True]