Results 81 to 90 of about 138,741 (178)

Exact Formula for Computing the Hyper-Wiener Index on Rows of Unit Cells of the Face-Centred Cubic Lattice

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances
Mujahed Hamzeh, Nagy Benedek
doaj   +1 more source

Steinitz theorems for simple orthogonal polyhedra

Journal of Computational Geometry, 2014
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex.By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we
David Eppstein, Elena Mumford
doaj   +1 more source

Equitable colorings of ��-corona products of cubic graphs [PDF]

Archives of Control Sciences
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one.
Hanna Furmańczyk, Marek Kubale
doaj   +1 more source

Permutations and cubic graphs [PDF]

Pacific Journal of Mathematics, 1983
Brenner, J. L., Lyndon, R. C.
openaire   +3 more sources

Total domination in cubic Kn��del graphs

, 2018
A subset $D$ of vertices of a graph $G$ is a \textit{dominating set} if for each $u\in V(G)\setminus D$, $u$ is adjacent to some vertex $v\in D$. The \textit{dominating number}, $ (G)$ of $G$, is the minimum cardinality of a dominating set of $G$. A set $D\subseteq V(G)$ is a \textit{total dominating set} if for each $u\in V(G)$, $u$ is adjacent to ...
Jafari Rad, Nader, Mojdeh, Doost Ali, Musawi, Reza, Nazari, E.   +3 more
openaire   +3 more sources

Perfect Pseudo-Matchings in Cubic Graphs

Graphs and Combinatorics
AbstractA M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to $$K_2$$ K 2 or to $$K_{1,3}$$ K 1 ,
Herbert Fleischner, Behrooz Bagheri Gh, Benedikt Klocker   +2 more
openaire   +2 more sources

Diameters of cubic graphs

Discrete Applied Mathematics, 1992
It is shown that a graph with maxima degree 3 and diameter \(d\geq 4\) cannot have exactly two vertices less than the Moore bound.
openaire   +2 more sources

Classifying cubic symmetric graphs of order 88p and 88p 2

Open Mathematics
For a simple graph Γ\Gamma , Γ\Gamma is said to be ss-regular, provided that the automorphism group of Γ\Gamma regularly acts on the set consisting of ss-arcs of Γ\Gamma .
Zhai Liangliang
doaj   +1 more source

Expansion properties of Whitehead moves on cubic graphs

Comptes Rendus. Mathématique
The present note concerns the “graph of graphs” that has cubic graphs as vertices connected by edges represented by the so-called Whitehead moves. Here, we prove that the outer-conductance of the graph of graphs tends to zero as the number of vertices ...
Grave de Peralta, Laura, Kolpakov, Alexander   +1 more
doaj   +1 more source

Disjoint Paired-Dominating sets in Cubic Graphs. [PDF]

Graphs Comb, 2019
Bacsó G, Bujtás C, Tompkins C, Tuza Z.
europepmc   +1 more source