84:
74:
53:
22:
162:
I'm trying to follow the text as closely as possible, but I find it hard to bring any understanding to the material without some illustrations. Is this article unusual, or is this problem common? I would think someone who could provide the text would also be able to provide some illustrations, if
469:
as they are not endorelations. The signed graph structure is a definite system, not just a table with +1 and −1 entries. It is suggested that you try to fit a link to this article into that one if you think it fits. But still, no references have been provided!
231:
Sections called
Adjacency matrix, Orientation, Incidence matrix and Switching were deleted as impertinent to this article. No references were given and wikilinks were unhelpful. This is a large deletion and invites comment.
489:, I'm not sure what you mean; there is no reference to any tables at root system. Maybe you mean there is some confusion about how the incidence matrix connects to the root system. This can be omitted.
140:
178:
It makes sense to ask for illustrations, but someone who knows how to write WP text may not know how to prepare WP illustrations. Such as me. Will someone help?
503:
By the way, a graph is not an "endorelation". There are several reasons, e.g., lack of direction, multiple edges, self-loops. But this is a side issue.
556:
130:
106:
551:
290:, has every possible positive and negative edge including negative loops, but no positive loops. Its edges correspond to the roots of the
427:
can be defined as the class of vertex sets of negative triangles (having an odd number of negative edges) in a signed complete graph.
97:
58:
524:
for tables containing 0s, 1s, and −1s. They are tables but not signed graphs. There does not appear to be a connection between
252:
The sections are highly pertinent. I do not understand your objection. I will restore the sections if you do not explain.
33:
168:
217:
387:
because a circle is positive if and only if it has even length. An all-negative graph with underlying graph
213:
164:
39:
83:
485:
Is your objection the lack of references? I can provide a reference for all these. As for tables at
21:
466:
105:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
89:
302:; the column of an edge in the incidence matrix (see below) is the vector representing the root.
73:
52:
533:
475:
436:
237:
508:
494:
451:
257:
183:
384:
327:
with a half-edge at every vertex. Its edges correspond to the roots of the root system
352:, is the same but without loops. Its edges correspond to the roots of the root system
545:
210:
must be defined. A well-labeled illustration, as Zaslav suggests above, could help.
529:
521:
471:
432:
420:
233:
525:
504:
490:
486:
462:
447:
291:
253:
179:
102:
79:
416:
383:
signed graph has only negative edges. It is balanced if and only if it is
446:
They are examples of signed graphs. I do not understand your objection.
537:
512:
498:
479:
455:
440:
415:. It may have any signs. Signed complete graphs are equivalent to
261:
241:
221:
187:
172:
522:
Root systems#Explicit construction of the irreducible root systems
368:
signed graph has only positive edges. If the underlying graph is
15:
244:
The sections claim to relate to Lie algebra classification C
336:, half-edges corresponding to the unit basis vectors.
101:, a collaborative effort to improve the coverage of
163:
only of their own understanding. Kinda puzzling. --
431:These "examples" do not illustrate the article.
158:This article could really use some illustrations
8:
194:The "Examples" section is not comprehensible
47:
372:, the all-positive signing is written +
49:
19:
7:
95:This article is within the scope of
38:It is of interest to the following
528:root systems and signed graphs. —
14:
557:Low-priority mathematics articles
281:vertices with loops, denoted by ±
115:Knowledge:WikiProject Mathematics
118:Template:WikiProject Mathematics
82:
72:
51:
20:
135:This article has been rated as
1:
173:16:55, 27 December 2010 (UTC)
109:and see a list of open tasks.
552:C-Class mathematics articles
480:04:35, 13 January 2023 (UTC)
456:20:57, 12 January 2023 (UTC)
406:the ordinary complete graph
262:20:59, 12 January 2023 (UTC)
188:09:47, 20 January 2011 (UTC)
573:
441:04:05, 26 March 2022 (UTC)
341:complete signed link graph
242:03:53, 26 March 2022 (UTC)
538:01:16, 3 March 2023 (UTC)
513:07:41, 2 March 2023 (UTC)
499:07:37, 2 March 2023 (UTC)
222:20:21, 2 April 2020 (UTC)
134:
67:
46:
419:, which are of value in
402:has as underlying graph
141:project's priority scale
98:WikiProject Mathematics
28:This article is rated
400:signed complete graph
307:complete signed graph
275:complete signed graph
121:mathematics articles
309:with half-edges, ±
90:Mathematics portal
34:content assessment
465:do not represent
155:
154:
151:
150:
147:
146:
564:
165:TheLastWordSword
123:
122:
119:
116:
113:
92:
87:
86:
76:
69:
68:
63:
55:
48:
31:
25:
24:
16:
572:
571:
567:
566:
565:
563:
562:
561:
542:
541:
414:
360:
351:
335:
326:
317:
301:
289:
270:
247:
229:
214:Arthur.Goldberg
196:
160:
120:
117:
114:
111:
110:
88:
81:
61:
32:on Knowledge's
29:
12:
11:
5:
570:
568:
560:
559:
554:
544:
543:
518:
517:
516:
515:
461:The tables at
459:
458:
429:
428:
410:
396:
377:
362:
356:
347:
337:
331:
322:
313:
303:
297:
285:
269:
266:
265:
264:
245:
228:
225:
195:
192:
191:
190:
159:
156:
153:
152:
149:
148:
145:
144:
133:
127:
126:
124:
107:the discussion
94:
93:
77:
65:
64:
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
569:
558:
555:
553:
550:
549:
547:
540:
539:
535:
531:
527:
523:
514:
510:
506:
502:
501:
500:
496:
492:
488:
484:
483:
482:
481:
477:
473:
468:
464:
457:
453:
449:
445:
444:
443:
442:
438:
434:
426:
422:
418:
413:
409:
405:
401:
397:
394:
390:
386:
382:
378:
375:
371:
367:
363:
359:
355:
350:
346:
342:
338:
334:
330:
325:
321:
316:
312:
308:
304:
300:
296:
293:
288:
284:
280:
276:
272:
271:
267:
263:
259:
255:
251:
250:
249:
243:
239:
235:
226:
224:
223:
219:
215:
211:
209:
205:
204:negative loop
201:
193:
189:
185:
181:
177:
176:
175:
174:
170:
166:
157:
142:
138:
132:
129:
128:
125:
108:
104:
100:
99:
91:
85:
80:
78:
75:
71:
70:
66:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
519:
460:
430:
424:
421:finite group
411:
407:
403:
399:
392:
391:is written −
388:
381:all-negative
380:
373:
369:
366:all-positive
365:
357:
353:
348:
344:
340:
332:
328:
323:
319:
314:
310:
306:
298:
294:
286:
282:
278:
274:
230:
212:
207:
203:
199:
197:
161:
137:Low-priority
136:
96:
62:Low‑priority
40:WikiProjects
526:Lie algebra
487:root system
463:root system
423:theory. A
292:root system
227:Orientation
112:Mathematics
103:mathematics
59:Mathematics
546:Categories
417:two-graphs
198:The terms
425:two-graph
385:bipartite
208:half-edge
268:Examples
530:Rgdboer
472:Rgdboer
433:Rgdboer
318:', is ±
234:Rgdboer
139:on the
30:C-class
505:Zaslav
491:Zaslav
467:graphs
448:Zaslav
254:Zaslav
206:, and
180:Zaslav
36:scale.
534:talk
520:See
509:talk
495:talk
476:talk
452:talk
437:talk
339:The
305:The
273:The
258:talk
238:talk
218:talk
200:loop
184:talk
169:talk
379:An
364:An
343:, ±
277:on
131:Low
548::
536:)
511:)
497:)
478:)
454:)
439:)
398:A
260:)
248::
240:)
220:)
202:,
186:)
171:)
532:(
507:(
493:(
474:(
450:(
435:(
412:n
408:K
404:G
395:.
393:G
389:G
376:.
374:G
370:G
361:.
358:n
354:D
349:n
345:K
333:n
329:B
324:n
320:K
315:n
311:K
299:n
295:C
287:n
283:K
279:n
256:(
246:n
236:(
216:(
182:(
167:(
143:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
