Results 51 to 60 of about 807 (75)
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
Factor-Critical Property in 3-Dominating-Critical Graphs
, 2006 A vertex subset $S$ of a graph $G$ is a dominating set if every vertex of $G$ either belongs to $S$ or is adjacent to a vertex of $S$. The cardinality of a smallest dominating set is called the dominating number of $G$ and is denoted by $\gamma(G)$.
Wang, Tao, Yu, Qinglin
core
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Cores, Joins and the Fano-Flow Conjectures
Discussiones Mathematicae Graph Theory, 2018 The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.
Jin Ligang +2 more
doaj +1 more source
Deficiency and Forbidden Subgraphs of Connected, Locally-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 A graph G is locally-connected if the neighbourhood NG(v) induces a connected subgraph for each vertex v in G. For a graph G, the deficiency of G is the number of vertices unsaturated by a maximum matching, denoted by def(G). In fact, the deficiency of a
Li Xihe, Wang Ligong
doaj +1 more source
Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application. [PDF]
Int J Appl Comput Math, 2022 Nazeer I, Rashid T.
europepmc +1 more source
Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph
Discussiones Mathematicae Graph Theory, 2018 For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of
Wang Xiumei, Lin Yixun
doaj +1 more source