On cliques of signed and switchable signed graphs
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Vertex coloring of a graph G with n-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of G to the complete graph Kn of order n. So, in that sense, the χ(G) of G will be the order of the smallest complete graph to which G admits a homomorphism to. As every graph, which is not a complete graph, admits a homomorphism to a smaller complete graph, we can redefine the χ(G) of G to be the order of the smallest graph to which G admits a homomorphism to. Of course, such a smallest graph must be a complete graph as they are the only graphs with equal to their order. The concept of vertex coloring can be generalize for other types of graphs, namely, oriented graphs (directed graphs with no cycle of length 1 or 2), 2-edge-colored or signed graphs (graphs with positive or negative signs assigned to each edge) and switchable signed graphs (equivalence class of signed graph with respect to switching signs of edges incident to the same vertex) using the notion of graph homomorphism. Naturally, the is defined to be the order of the smallest graph (of the same type) to which a graph admits homomorphism to. For the above mentioned type of graphs, the graphs with smallest order, that is, the graphs with order equal to their (so defined) chromatic number are called ocliques, scliques and [s]-cliques respectively. These cliques turns out to be much more complicated than their undirected counterpart and are interesting objects of study. In this article, we mainly study different aspects of cliques for signed and switchable signed graphs. In particular, we show that it is NP-hard to decide if edges of a given undirected graph can be assigned positive and negative signatures such that it becomes an sclique or an [s]-clique. We also show that, asymptotically, almost all signed graphs are scliques or [s]-cliques. Furthermore, we prove a sufficient and necessary condition for a signed graph (or switchable signed graph) to be an sclique (or [s]-clique). We study the of vertices that an sclique (or [s]-clique) can have when their underlying graph is planar and prove a tight upper bound of 15. We also study the same for outerplanar graphs and planar graphs with given girth (length of the smallest cycle). Finally, we generalize the concept of cliques for n-edge-colored graphs (graphs with one among n different colors assigned to each of its edge) and do a similar study for outerplanar and planar graphs.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle