Melola Discovery

← Melola Discovery

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

DOI
10.5614/ejgta.2016.4.2.2
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 penulisOrganisasiArtikel bersama
U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India SameeAfiliasi tidak diketahui1
S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India PirzadaAfiliasi tidak diketahui1
Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia AlghamadiAfiliasi tidak diketahui1
Uma Tul; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India SameeAfiliasi tidak diketahui1
Edy Tri; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung, Indonesia BaskoroAfiliasi tidak diketahui1
Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India ShahAfiliasi tidak diketahui1

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.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">On some covering graphs of a graph</dc:title>
	<dc:creator>Pirzada, Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India</dc:creator>
	<dc:creator>Ganie, Hilal A; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India</dc:creator>
	<dc:creator>Siddique, Merajuddin; Department of Applied Mathematics, Aligarh Muslim University, Aligarh, India</dc:creator>
	<dc:subject xml:lang="en-US">Covering graph, maximum degree, covering set, maximum degree minimum covering graph, covering number, independence number</dc:subject>
	<dc:description xml:lang="en-US">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$.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/166</dc:identifier>
	<dc:identifier>10.5614/ejgta.2016.4.2.2</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications; 132-147</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/166/pdf_22</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>