Results 11 to 20 of about 27,255 (245)
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
The k-subconnectedness of planar graphs
AIMS Mathematics, 2021 A graph G with at least 2k vertices is called k-subconnected if, for any 2k vertices x1,x2,⋯,x2k in G, there are k independent paths joining the 2k vertices in pairs in G.
Zongrong Qin, Dingjun Lou
doaj +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source
The small intersection graph of filters of a bounded distributive lattice [PDF]
Journal of Mahani Mathematical Research, 2023 Let $L$ be a lattice with $1$ and $0$. The small intersection graph of filters of $L$, denoted by $\Gamma(L)$, is defined to be a graph whose vertices are in one to one correspondence with all non-trivial filters of $L$ and two distinct vertices are ...
Shahabaddin Ebrahimi Atani +2 more
doaj +1 more source
Computational Study on a PTAS for Planar Dominating Set Problem
Algorithms, 2013 The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time ...
Qian-Ping Gu, Marjan Marzban
doaj +1 more source
Acyclic Chromatic Index of 1-Planar Graphs
Mathematics, 2022 The acyclic chromatic index χa′(G) of a graph G is the smallest k for which G is a proper edge colorable using k colors. A 1-planar graph is a graph that can be drawn in plane such that every edge is crossed by at most one other edge.
Wanshun Yang +5 more
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
Кібернетика та комп'ютерні технології, 2020 The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Strongly Multiplicative Labeling of Diamond Graph, Generalized Petersen Graph, and Some Other Graphs
Journal of Mathematics, 2022 A finite, simple graph of order k is said to be a strongly multiplicative graph when all vertices of the graph are labeled by positive integers 1,2,3,…,k such that the induced edge labels of the graph, obtained by the product of labels of end vertices of
Sumiya Nasir +5 more
doaj +1 more source
Hosoya Polynomial, Wiener Index, Coloring and Planar of Annihilator Graph of Zn [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2020 Let R be a commutative ring with identity. We consider ΓB(R) an annihilator graph of the commutative ring R. In this paper, we find Hosoya polynomial, Wiener index, Coloring, and Planar annihilator graph of Zn denote ΓB(Zn) , with n= pm or n=pmq, where p,
Mohammed Ahmed +2 more
doaj +1 more source