Results 31 to 40 of about 808 (100)
A Short Note on Undirected Fitch Graphs
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic ...
Geiß, Manuela +3 more
core +1 more source
Equimatchable Bipartite Graphs
A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin +2 more
doaj +1 more source
On Some Characterizations of Antipodal Partial Cubes
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
Describing Minor 5-Stars in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree 6 or 7
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
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
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
The Cayley Sum Graph of Ideals of a Lattice
Let L be a lattice, 𝒥(L) be the set of ideals of L and S be a subset of 𝒥 (L). In this paper, we introduce an undirected Cayley graph of L, denoted by ΓL,S with elements of 𝒥 (L) as the vertex set and, for two distinct vertices I and J, I is adjacent to ...
Afkhami Mojgan +2 more
doaj +1 more source
The double competition multigraph of a digraph
In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of ...
Park, Jeongmi, Sano, Yoshio
core +2 more sources
Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9
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
This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
Realizing the chromatic numbers and orders of spinal quadrangulations of surfaces [PDF]
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

