Results 1 to 10 of about 2,638 (153)
Fractional matching preclusion for generalized augmented cubes [PDF]
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +6 more sources
Strong matching preclusion for augmented cubes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Steffy +2 more
exaly +4 more sources
Conditional edge-fault pancyclicity of augmented cubes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongqin Cheng +2 more
+11 more sources
On regular subgraphs of augmented cubes [PDF]
The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +2 more sources
The optimal routing of augmented cubes [PDF]
A routing in a graph G is a set of paths connecting each ordered pair of vertices. Load of an edge e is the number of times it appears on these paths. The edge-forwarding index of G is the smallest of maximum loads over all routings. Augmented cube of dimension n, AQ n , is the Cayley graph (Z n 2 , {e 1 , e 2 ,. .. , e n , J 2 ,. .. , J n }) where e i
Meirun Chen, Reza Naserasr
openalex +5 more sources
Out of the Cube: Augmented Rubik's Cube [PDF]
Computer gaming habits have a tendency to evolve with technology, the best being ones that immerse both our imagination and intellect. Here, we describe a new game platform, anAugmented Reality Rubik's cube. The cube acts simultaneously as both the controller and the game board. Gameplay is controlled by the cube, and game assets are rendered on top of
Oriel Bergig +7 more
openalex +4 more sources
Pendant 3-Tree Connectivity of Augmented Cubes [PDF]
Abstract The Steiner tree problems in graphs attended widely because of its applications in network design or circuit layout. Given a set $S$ of vertices, $|S| \geq 2,$ a tree connecting all vertices of $S$ is called an $S$-Steiner tree (tree connecting $S$). The reliability of a network $G$ to connect any $S$ vertices ($|S|$ number of vertices)
S. A. Mane, S. A. Kandekar
openalex +3 more sources
Maximum Induced Subgraph of an Augmented Cube
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube AQn.
Meng-Jou Chien +2 more
+16 more sources
Augmented Reality Cubes for Cognitive Gaming: Preliminary Usability and Game Experience Testing [PDF]
Early detection is important in dementia care; however, cognitive impairment is still under-recognised and under-diagnosed. Cognitive screening and training are two important preventative treatments, which can lead to early detection of cognitive decline.
Costas Boletsis, Simon McCallum
doaj +2 more sources
Component Connectivity of Augmented Cubes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qifan Zhang, Shuming Zhou, Eddie Cheng
openalex +3 more sources

