Zobrazeno 1 - 10
of 1 583
pro vyhledávání: '"Clique graph"'
Autor:
S Ragha, R Rajeswari
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 371-378 (2022)
The aim of this paper is to examine various graph parameters of clique graph of cyclic subgroup graph on certain non-abelian groups and also we obtain some theorems and results in detail
Externí odkaz:
https://doaj.org/article/a4175cd6f5ff484b8bb527a0041fa26d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sasan Sabour, Ali Moeini
Publikováno v:
International Journal of Information and Communication Technology Research, Vol 11, Iss 4, Pp 48-56 (2019)
Community detection is one of the important topics regarding complex network study. There are many community detection algorithms such as Streaming Community Detection Algorithm (SCoDA) and Order Statistics Local Optimization Method (OSLOM). However,
Externí odkaz:
https://doaj.org/article/e713e942071b4f0dacf1ac2cc3076fd6
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Geneviève Simonet, Anne Berry
Publikováno v:
Algorithms, Vol 15, Iss 8, p 294 (2022)
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose at
Externí odkaz:
https://doaj.org/article/dc45d7d7ac6b4f729fe8bb77ac08f743
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Celina M. H. de Figueiredo, Renato Portugal, Franklin de Lima Marquezino, Alexandre Santiago de Abreu, Daniel Posner, Luís Felipe I. Cunha
Publikováno v:
Discrete Applied Mathematics. 323:149-161
The concept of graph tessellation cover was defined in the context of quantum walk models, and is a current research area in graph theory. In this work, we propose a generalization called total tessellation cover. A tessellation of a graph G is a par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3326ecc7a633bf06ea07c864123a3c3b
https://doi.org/10.1016/j.dam.2021.09.032
https://doi.org/10.1016/j.dam.2021.09.032
Publikováno v:
Modelirovanie i Analiz Informacionnyh Sistem, Vol 28, Iss 2, Pp 126-135 (2021)
Modern network systems (unmanned aerial vehicles groups, social networks, network production chains, transport and logistics networks, communication networks, cryptocurrency networks) are distinguished by their multi-element nature and the dynamics o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::269fafaa3379c212d0d6ebca03b3160b
https://doi.org/10.3103/s0146411622070215
https://doi.org/10.3103/s0146411622070215
Autor:
Gentleman, Robert, Vandal, Alain C.
Publikováno v:
The Canadian Journal of Statistics / La Revue Canadienne de Statistique, 2002 Dec 01. 30(4), 557-571.
Externí odkaz:
https://www.jstor.org/stable/3316096
Autor:
Dipika Singh, Rakhi Garg
Publikováno v:
Journal of King Saud University - Computer and Information Sciences. 34:7765-7774
Community detection is an important area of research in social media mining. Numerous algorithms have been developed to detect disjoint, overlapping, and dynamic communities in a network. However, most of the existing algorithms do not consider the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2cea83400bfcded73f574bf2cf23a59
https://doi.org/10.1016/j.jksuci.2021.07.006
https://doi.org/10.1016/j.jksuci.2021.07.006