Zobrazeno 1 - 10
of 1 288
pro vyhledávání: '"clique number"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-11 (2024)
The computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking. A subset [Formula: see text] of non-negative integers [
Externí odkaz:
https://doaj.org/article/abfc2b24c0cd4d2081004307040075c9
Autor:
Prohelika Das, Bipanchy Buzarbarua
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-8 (2024)
Let [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal compone
Externí odkaz:
https://doaj.org/article/8628a28d294c4adfa5a106a62a0e18e9
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 77-83 (2024)
AbstractA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G i
Externí odkaz:
https://doaj.org/article/01b3946da54f46799e7bb5707e5fef54
Publikováno v:
ریاضی و جامعه, Vol 8, Iss 4, Pp 71-79 (2023)
Let $G$ be a finite non-trivial group. The intersection graph $\Gamma(G)$, is a graph whose vertices are all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H $ and $K$ if and only if $H\cap K\neq 1$. In this
Externí odkaz:
https://doaj.org/article/2ac91738e5bd4b9bb035e5df14d5746c
Publikováno v:
Symmetry, Vol 16, Iss 7, p 854 (2024)
A subset S of non-negative integers No is called a numerical semigroup if it is a submonoid of No and has a finite complement in No. An undirected graph G(S) associated with S is a graph having V(G(S))={vi:i∈No∖S} and E(G(S))={vivj⇔i+j∈S}. In
Externí odkaz:
https://doaj.org/article/9f7a163a1e2941a2a78ab9401b45947d
Publikováno v:
Ratio Mathematica, Vol 51, Iss 0 (2024)
Let \( R \) be a finite commutative ring with unity. We have introduced a divisor graph of the ring, denoted by \( D[R] \). It is an undirected simple graph with a vertex set \( V = R - \{0, 1\} \), and two distinct vertices \( u \) and \( v \) in \(
Externí odkaz:
https://doaj.org/article/12d1d0bcb1bf4fcd912d9b20d53b3bab
Autor:
Marena Rahayu Gayatri, Nurhabibah Nurhabibah, Qurratul Aini, Zata Yumni Awanis, Salwa Salwa, I Gede Adhitya Wisnu Wardhana
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 7, Iss 2, Pp 409-416 (2023)
Graph theory can give a representation of abstract mathematical systems such as groups or rings. We have many graph representations for a group, in this study we use the coprime graph representation for a generalized quaternion group to find the nume
Externí odkaz:
https://doaj.org/article/454ff03e44da4d08bbd30792e6c4ceff