Results 61 to 70 of about 5,839 (198)
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +2 more sources
Journal of Spectral Imaging, 2018 Nowadays, quality inspection of fruit and vegetables is typically accomplished through visual inspection. Automation of this inspection is desirable to make it more objective.
Jeroen van Roy +3 more
doaj +1 more source
Extraconnectivity of hypercubes
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weihua Yang, Jixiang Meng
openaire +1 more source
, 2016 Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertices. In modern computing, hypercubes play an important role. This is because any input of an algorithm, as a 0-1 sequence, can be embedded into a hypercube.
Kidner, Arnott
core
Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks
Fractal and FractionalNetworks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by Qn. In a recent study, the hypercube
Savari Prabhu +2 more
doaj +1 more source
The Wiener Polynomial of the kth Power Graph
International Journal of Mathematics and Mathematical Sciences, 2007 We presented a formula for the Wiener polynomial of the kth power graph. We use this formula to find the Wiener polynomials of the kth power graphs of paths, cycles, ladder graphs, and hypercubes. Also, we compute the Wiener indices of these graphs.
Omar A. AbuGhneim +2 more
doaj +1 more source
The carvingwidth of hypercubes
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandran, Sunil L, Kavitha, T
openaire +1 more source
The $t/s$ -Diagnosability of Hypercube Networks Under the PMC and Comparison Models
IEEE Access, 2017 A t/s-diagnosable system, a generalization of t/t-diagnosable system, refers to such a system that all the faulty nodes of the system can be isolated within a set of size at most s in the presence of at most t faulty nodes.
Jiarong Liang, Qian Zhang
doaj +1 more source
A characterization of hypercubes
Discrete Mathematics, 1977 AbstractA combinatorial characterization of hypercubes is given. A hypercube is defined as the undirected Hasse diagram of a Boolean lattice. The method used is inductive extension of partial isomorphisms.
openaire +1 more source
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics, 2007 In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil \log_2 N \rceil$ rounds in a network of N nodes. In the neighborhood broadcasting problem, the node that is broadcasting needs to inform only its neighbors. In
Bermond, Jean-Claude +3 more
openaire +2 more sources