Results 1 to 10 of about 366,766 (262)
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +2 more sources
On central-peripheral appendage numbers of uniform central graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 In a uniform central graph (UCG) the set of eccentric vertices of a central vertex is the same for all central vertices. This collection of eccentric vertices is the centered periphery.
Sul-Young Choi, Jonathan Needleman
doaj +3 more sources
The non-commuting graph of a non-central hypergroup
Open Mathematics, 2019 The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Irina Cristea, Morteza Jafarpour
exaly +2 more sources
Discrete Mathematics, 1982 AbstractWe examine several graph equations involving the center, C(G), of a graph G. The central ratio of G, denoted c(G), is the ratio of |C(G)| to |V(G)|. We show that for any rational number r, where 0 < r ⩽ 1, there is a graph G with c(G) = r. For all such r, we describe a corresponding minimal graph.
exaly +2 more sources
Journal of King Saud University - Computer and Information SciencesEffectively distinguishing fine-grained actions remains a critical challenge in skeleton-based action recognition. Existing Graph Convolutional Network methods often overlook directional motion cues and fail to integrate spatiotemporal features ...
Xinlu Zong
exaly +2 more sources
Commuting conjugacy classes graph of the generalized dihedral and dicyclic groups [PDF]
ریاضی و جامعه, 2023 Suppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a simple graph with the non-central conjugacy classes of $G$ as its vertex set. Two different non-central conjugacy classes $A$ and $B$ are assumed to be adjacent if and only if there are ...
Mohammadali Salahshour
doaj +1 more source
Research on Imbalance Fraud Detection Based on Graph Neural Network [PDF]
Jisuanji gongcheng, 2023 Currently, graph neural network is widely used in fraud detection. Because of the class imbalance problem in fraud detection, the performance of the model based on graph neural network is poor. To solve these problems, an unbalanced fraud detection model
Anqi CHEN, Rui CHEN, Zhufang KUANG, Huajun HUANG
doaj +1 more source
On the r-dynamic coloring of some fan graph families
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
Central Clustering of Attributed Graphs [PDF]
Machine Learning, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brijnesh J. Jain, Fritz Wysotzki
openaire +1 more source