2021
DOI: 10.3390/math9121419
|View full text |Cite
|
Sign up to set email alerts
|

Figures of Graph Partitioning by Counting, Sequence and Layer Matrices

Abstract: A series of counting, sequence and layer matrices are considered precursors of classifiers capable of providing the partitions of the vertices of graphs. Classifiers are given to provide different degrees of distinctiveness for the vertices of the graphs. Any partition can be represented with colors. Following this fundamental idea, it was proposed to color the graphs according to the partitions of the graph vertices. Two alternative cases were identified: when the order of the sets in the partition is relevan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 75 publications
0
7
0
Order By: Relevance
“…In the following text, we present the pseudo-code Algorithms 2-4 for our swing up method and the LQR for a low-cost RIP platform. The following algorithms of the different calculations for the RIP case are given based on their writing according to the authors [34]. The experimental results are shown in Figures 12-18.…”
Section: Resultsmentioning
confidence: 99%
“…In the following text, we present the pseudo-code Algorithms 2-4 for our swing up method and the LQR for a low-cost RIP platform. The following algorithms of the different calculations for the RIP case are given based on their writing according to the authors [34]. The experimental results are shown in Figures 12-18.…”
Section: Resultsmentioning
confidence: 99%
“…Finally, from the aspect of visualization, a citation network which consists of a large number of patents or publications cannot be visualized easily. Appropriate strategies to filter less important paths and/or nodes and leave the most dominant ones or partition the graph (e.g., [81]) will be very helpful for clearly demonstrating the citations. Moreover, choosing dense-areas which pass specific threshold-value of connectedness will also be feasible.…”
Section: Limitations and Future Possibilitiesmentioning
confidence: 99%
“…It is worth mentioning here that recent research work on graph colorings extends beyond the study of proper colorings. For more details, we refer the reader to [6,7] and references therein.…”
Section: Introductionmentioning
confidence: 99%