Results 21 to 30 of about 294 (70)
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
THE SECOND EDGE-WIENER INDEX OF SOME COMPOSITE GRAPHS
, 2014 In this paper we study the behavior of the second edge-Wiener index under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.
M. Azari, A. Iranmanesh
semanticscholar +1 more source
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
Discussiones Mathematicae Graph Theory, 2018 The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj +1 more source
, 2015 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi, Lorenzo
core +4 more sources
Voting for Committees in Agreeable Societies
, 2014 We examine the following voting situation. A committee of $k$ people is to be formed from a pool of n candidates. The voters selecting the committee will submit a list of $j$ candidates that they would prefer to be on the committee.
Davis, Matt +2 more
core +1 more source
The classification of partially symmetric 3-braid links
Open Mathematics, 2015 We classify 3-braid links which are amphicheiral as unoriented links, including a new proof of Birman- Menasco’s result for the (orientedly) amphicheiral 3-braid links. Then we classify the partially invertible 3-braid links.
Stoimenov Alexander
doaj +1 more source
Graph connectivity and universal rigidity of bar frameworks [PDF]
, 2014 Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally rigid.
Alfakih, A. Y.
core
Path separation by short cycles
, 2016 Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths ...
Cibulka +9 more
core +1 more source