On the Addressing Problem for Loop Switching

Cited in

(only showing first 100 items - show all)

Subdivided graphs as isometric subgraphs of Hamming graphs
On covering graphs by complete bipartite subgraphs
On decompositions of complete hypergraphs
On verifying and engineering the wellgradedness of a union-closed family
Isometric embeddings of subdivided connected graphs into hypercubes
Proof of the squashed cube conjecture
On the addressing problem for directed graphs
Clique partitions of the cocktail party graph
Collapse of the metric hierarchy for bipartite graphs
Node-graceful graphs
Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
Isometric embeddings in Hamming graphs
On the complexity of testing a graph for n-cube
Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales
Representations of graphs and networks (coding, layouts and embeddings)
On tournament matrices
Multicolored forests in bipartite decompositions of graphs
On the immersion of digraphs in cubes
On cubical graphs
Embedding finite posets in cubes
On the distance matrix of a tree
Distance matrix polynomials of trees
Decompositions of complete multigraphs related to Hadamard matrices
Laplacian matrices of graphs: A survey
Non-deterministic communication complexity with few witnesses
On the natural imprint function of a graph
Covering a graph by complete bipartite graphs
Mixed dominating matrices
Quasi-median graphs, their generalizations, and tree-like equalities
Decompositions of complete multigraphs derived from Hadamard matrices
Isometric embeddings of subdivided wheels in hypercubes
Inertia and biclique decompositions of joins of graphs
Fast recognition algorithms for classes of partial cubes
Cubic inflation, mirror graphs, regular maps, and partial cubes
On Cartesian product of Euclidean distance matrices
Graph families with constant distance determinant
On the distance spectra of threshold graphs
Euclidean graph distance matrices of generalizations of the star graph
Decomposing the complete \(r\)-graph
Improved bounds for the Graham-Pollak problem for hypergraphs
A note on distance spectral radius of trees
On distance spectral radius of uniform hypergraphs with cycles
Inertia and distance energy of line graphs of unicyclic graphs
On least distance eigenvalue of uniform hypergraphs
On the first two largest distance Laplacian eigenvalues of unicyclic graphs
On distance matrices and Laplacians
Distance matrices on the \textit{H-join} of graphs: a general result and applications
On biclique decompositions of complete \(t\)-partite graphs
Characterizing the flow equivalent trees of a network
Decomposition of the complete r-graph into complete r-partite r-graphs
Addressing the Petersen graph
Application of cut polyhedra. I
On distance spectral radius of graphs
A tree whose complement is not eigensharp
Wiener index and addressing of the total graph
On the distance and distance signless Laplacian spectral radii of tricyclic graphs
Distance eigenvalues and forwarding indices of circulants
Addressing graph products and distance-regular graphs
The distance spectrum of complements of trees
Graphs whose distance matrix has at most three negative eigenvalues
Distance matrices of subsets of the Hamming cube
On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices
Multicovering hypergraphs
The distance matrix of caterpillar
Distance and distance signless Laplacian spread of connected graphs
Eigenvalues and clique partitions of graphs
On the distance -spectral radius of a connected graph
On the distance spectrum of minimal cages and associated distance biregular graphs
Extremal results on distance Laplacian spectral radius of graphs
Distance spectrum, 1-factor and vertex-disjoint cycles
The 2-Steiner distance matrix of a tree
The edge general position problem
A q-analogue of the bipartite distance matrix of a nonsingular tree
Characterization of 2-arc-transitive partial cubes
The binary rank of circulant block matrices
Regarding two conjectures on clique and biclique partitions
Computing the determinant of the distance matrix of a bicyclic graph
Eigenvalues of Cayley graphs
On the rank of the distance matrix of graphs
Distance spectral radius of trees with given number of segments
Bounds on the \(\alpha \)-distance energy and \(\alpha \)-distance Estrada index of graphs
On partial cubes, well-graded families and their duals with some applications in graphs
Smith normal form of a distance matrix inspired by the four-point condition
The determinant of the distance matrix of graphs with blocks at most bicyclic
The distance energy of clique trees
Perfect matching and distance spectral radius in graphs and bipartite graphs
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
Gain distance matrices for complex unit gain graphs
Coloring temporal graphs
The bipartite distance matrix of a nonsingular tree
Which numbers are status differences?
The effect of a graft transformation on distance spectral radius
Distance spectra of graphs: a survey
Conformally covariant operators and conformal invariants on weighted graphs
Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
Nearly neighbourly families of standard boxes
Inverse of the distance matrix of a weighted cactoid digraph
On adjacency-distance spectral radius and spread of graphs
On rainbow-cycle-forbidding edge colorings of finite graphs
On tope graphs of complexes of oriented matroids

This page was built for publication: On the Addressing Problem for Loop Switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636776)