Results 11 to 20 of about 33,012 (267)
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
SOME PROPERTIES ON COPRIME GRAPH OF GENERALIZED QUATERNION GROUPS
Barekeng, 2023 A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime.
Arif Munandar
doaj +1 more source
On certain prime cordial families of graphs
Journal of Taibah University for Science, 2020 Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling.
Nazeran Idrees +3 more
doaj +1 more source
On Longest Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A planar 3-connected graph G is essentially 4-connected if, for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex.
Fabrici Igor +2 more
doaj +1 more source
Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable
Mathematics, 2022 In simple graphs, DP-coloring is a generalization of list coloring and thus many results of DP-coloring generalize those of list coloring. Xu and Wu proved that every planar graph without 5-cycles adjacent simultaneously to 3-cycles and 4-cycles is 4 ...
Kittikorn Nakprasit +2 more
doaj +1 more source
Multiscale planar graph generation
Applied Network Science, 2019 The study of network representations of physical, biological, and social phenomena can help us better understand their structure and functional dynamics as well as formulate predictive models of these phenomena. However, due to the scarcity of real-world
Varsha Chauhan +2 more
doaj +1 more source
Total Coloring of Dumbbell Maximal Planar Graphs
Mathematics, 2022 The Total Coloring Conjecture (TCC) states that every simple graph G is totally (Δ+2)-colorable, where Δ denotes the maximum degree of G. In this paper, we prove that TCC holds for dumbbell maximal planar graphs.
Yangyang Zhou +3 more
doaj +1 more source
Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants
Molecules, 2023 A branch of graph theory that makes use of a molecular graph is called chemical graph theory. Chemical graph theory is used to depict a chemical molecule. A graph is connected if there is an edge between every pair of vertices.
Zheng-Qing Chu +5 more
doaj +1 more source
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Discrete Dynamics in Nature and Society, 2020 A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
Total Coloring of Claw-Free Planar Graphs
Discussiones Mathematicae Graph Theory, 2022 A total coloring of a graph is an assignment of colors to both its vertices and edges so that adjacent or incident elements acquire distinct colors. Let Δ(G) be the maximum degree of G.
Liang Zuosong
doaj +1 more source