![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
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 only of their own understanding. Kinda puzzling. -- TheLastWordSword ( talk) 16:55, 27 December 2010 (UTC)
The terms loop, negative loop, and half-edge must be defined. A well-labeled illustration, as Zaslav suggests above, could help.
Arthur.Goldberg ( talk) 20:21, 2 April 2020 (UTC)
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. Rgdboer ( talk) 03:53, 26 March 2022 (UTC) The sections claim to relate to Lie algebra classification Cn:
These "examples" do not illustrate the article. Rgdboer ( talk) 04:05, 26 March 2022 (UTC)
The tables at root system do not represent graphs 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! Rgdboer ( talk) 04:35, 13 January 2023 (UTC)
See Root systems#Explicit construction of the irreducible root systems for tables containing 0s, 1s, and −1s. They are tables but not signed graphs. There does not appear to be a connection between Lie algebra root systems and signed graphs. — Rgdboer ( talk) 01:16, 3 March 2023 (UTC)
![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
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 only of their own understanding. Kinda puzzling. -- TheLastWordSword ( talk) 16:55, 27 December 2010 (UTC)
The terms loop, negative loop, and half-edge must be defined. A well-labeled illustration, as Zaslav suggests above, could help.
Arthur.Goldberg ( talk) 20:21, 2 April 2020 (UTC)
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. Rgdboer ( talk) 03:53, 26 March 2022 (UTC) The sections claim to relate to Lie algebra classification Cn:
These "examples" do not illustrate the article. Rgdboer ( talk) 04:05, 26 March 2022 (UTC)
The tables at root system do not represent graphs 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! Rgdboer ( talk) 04:35, 13 January 2023 (UTC)
See Root systems#Explicit construction of the irreducible root systems for tables containing 0s, 1s, and −1s. They are tables but not signed graphs. There does not appear to be a connection between Lie algebra root systems and signed graphs. — Rgdboer ( talk) 01:16, 3 March 2023 (UTC)