2020-01-09 21:55:08 +0100 | commented question | How to find the sum weight on a vertex I wanted to obtain an antimagic labeling. A graph G is antimagic if there exists a bijective edge labeling from E(G) to {1,..., |E(G)|} such that the vertex sums are pairwise distinct. If you have another code, I will appreciate if you tell me. |

2020-01-09 21:48:36 +0100 | commented question | How to find the sum weight on a vertex q=G.num_edges() I get these errors: |

2020-01-09 16:51:11 +0100 | asked a question | How to find the sum weight on a vertex Hi I want to define a random labeling on edges of a graph (without duplicate labels ) and then find the sum of the weights of incident edges to each vertex. Here is code I wrote: But I receive some errors. I'll be happy if you can help me. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.