Results 41 to 50 of about 808 (83)
On Some Characterizations of Antipodal Partial Cubes
Discussiones Mathematicae Graph Theory, 2019 We prove that any harmonic partial cube is antipodal, which was conjectured by Fukuda and K. Handa, Antipodal graphs and oriented matroids, Discrete Math. 111 (1993) 245–256.
Polat Norbert
doaj +1 more source
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
Discussiones Mathematicae Graph Theory, 2017 A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices.
Baudon Olivier +3 more
doaj +1 more source
Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9
Discussiones Mathematicae Graph Theory, 2020 In 1940, Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P5 of 3-polytopes with minimum degree 5.
Borodin Oleg V. +2 more
doaj +1 more source
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
On the Non-Inverse Graph of a Group
Discussiones Mathematicae - General Algebra and Applications, 2022 Let (G, *) be a finite group and S = {u ∈ G|u ≠ u−1}, then the inverse graph is defined as a graph whose vertices coincide with G such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S.
Amreen Javeria, Naduvath Sudev
doaj +1 more source
Realizing the chromatic numbers and orders of spinal quadrangulations of surfaces [PDF]
, 2013 A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G. Ringel's results
Lawrencenko, Serge
core
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Decompositions of Cubic Traceable Graphs
Discussiones Mathematicae Graph Theory, 2020 A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +1 more source
Describing Minor 5-Stars in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree 6 or 7
Discussiones Mathematicae Graph Theory, 2022 In 1940, in attempts to solve the Four Color Problem, Henry Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P5 of 3-polytopes with minimum degree 5. This description depends on 32 main parameters.
Batueva Ts.Ch-D. +3 more
doaj +1 more source
On the Genus of the Co-Annihilating Graph of Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 Let R be a commutative ring with identity and 𝒰R be the set of all nonzero non-units of R. The co-annihilating graph of R, denoted by 𝒞𝒜R, is a graph with vertex set 𝒰R and two vertices x and y are adjacent whenever ann(x) ∩ ann(y) = (0).
Selvakumar K., Karthik S.
doaj +1 more source