Jurnal SINTA 1
On some covering graphs of a graph
Electronic Journal of Graph Theory and Applications · Vol. 4 No. 2 (2016) · hlm. 132–147
- ISSN
- 2338-2287
- Terbit
- 2016-10-08
- Penerbit
- GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
- Bahasa
- eng
Abstrak
For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\{u\in S: uv \in E(G) \}\cup \{v\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G)= (a_{ij}),$ by $a_{ij}=1,$ if $\left |N_S[v_i]\cap N_S[v_j] \right| \geq 1, i\neq j$ and 0, otherwise. The graph $G^S$ associated with the matrix $A_S(G)$ is called the maximum degree minimum covering graph (MDMC-graph) of the graph $G$. In this paper, we give conditions for the graph $G^S$ to be bipartite and Hamiltonian. Also we obtain a bound for the number of edges of the graph $G^S$ in terms of the structure of $G$. Further we obtain an upper bound for covering number (independence number) of $G^S$ in terms of the covering number (independence number) of $G$.
Kata kunci
Jaringan kolaborasi para penulis
9 penulis · 13 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
- Afiliasi tidak diketahui
- Organisasi berbeda
- Organisasi sama
- Afiliasi tidak diketahui
- Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
| Rekan penulis | Organisasi | Artikel bersama |
|---|---|---|
| U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India Samee | Afiliasi tidak diketahui | 1 |
| S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India Pirzada | Afiliasi tidak diketahui | 1 |
| Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia Alghamadi | Afiliasi tidak diketahui | 1 |
| Uma Tul; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India Samee | Afiliasi tidak diketahui | 1 |
| Edy Tri; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung, Indonesia Baskoro | Afiliasi tidak diketahui | 1 |
| Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India Shah | Afiliasi tidak diketahui | 1 |
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.