On the Addressing Problem for Loop Switching
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Binary stretch embedding of weighted graphs
- On eigensharp and almost eigensharp graphs
- On partial cubes, well-graded families and their duals with some applications in graphs
- Extremal properties of the distance spectral radius of hypergraphs
- Distance matrix of weighted cactoid-type digraphs
- On adjacency-distance spectral radius and spread of graphs
- The inertia and energy of the distance matrix of a connected graph
- On the distance spectra of graphs
- The bipartite distance matrix of a nonsingular tree
- The metric dimension \& distance spectrum of non-commuting graph of dihedral group
- Wiener index and addressing of the total graph
- On the distance and distance signless Laplacian spectral radii of tricyclic graphs
- On set intersection representations of graphs
- Reconstructing a graph from the boundary distance matrix
- Fast recognition algorithms for classes of partial cubes
- Addressing graph products and distance-regular graphs
- On biclique decompositions of complete \(t\)-partite graphs
- Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
- Network analysis with the aid of the path length matrix
- On the natural imprint function of a graph
- Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
- Distance spectra of some double join operations of graphs
- Graphs that are cospectral for the distance Laplacian
- On the decomposition of random hypergraphs
- On least distance eigenvalue of uniform hypergraphs
- Resistance matrices of balanced directed graphs
- On the resistance matrix of a graph
- Ordering trees by their distance spectral radii
- Toughness, fractional extendability and distance spectral radius in graphs
- The de Bruijn-Erdős theorem for hypergraphs
- Addressing the Petersen graph
- Distance matrix of a class of completely positive graphs: determinant and inverse
- Gain distance matrices for complex unit gain graphs
- Computation of the biclique partition number for graphs with specific blocks
- Graph transformation and distance spectral radius
- Distance eigenvalues and forwarding indices of circulants
- The spectral radius of Steiner distance hypermatrices of graphs
- Two Laplacians for the distance matrix of a graph
- Decomposition of geometric graphs into star-forests
- Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
- On the distance spectrum of generalized balanced trees
- Some graft transformations and its applications on the distance spectral radius of a graph
- On distance and Laplacian matrices of trees with matrix weights
- Labeled sample compression schemes for complexes of oriented matroids
- Distance matrix and Laplacian of a tree with attached graphs
- Decompositions of complete multigraphs derived from Hadamard matrices
- Squared distance matrix of a weighted tree
- D-integral, D^Q-integral and D^L-integral generalized double-wheel graphs
- On decompositions of complete hypergraphs
- There are no finite partial cubes of girth more than 6 and minimum degree at least 3
- The product distance matrix of a tree with matrix weights on its arcs
- Proof of the squashed cube conjecture
- Identities for minors of the Laplacian, resistance and distance matrices
- The biclique covering number of grids
- Isometric embedding of subdivided Connected graphs in the hypercube
- The distance matrix of a tree with weights on its arcs
- On the determinant of \(q\)-distance matrix of a graph
- Isometric embeddings of subdivided complete graphs in the hypercube
- On the hyperdeterminants of Steiner distance hypermatrices
- Node-graceful graphs
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
- On Euclidean distance matrices
- Isometric Hamming embeddings of weighted graphs
- The distance spectrum of complements of trees
- Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
- On squared distance matrix of complete multipartite graphs
- On the inverse and Moore-Penrose inverse of resistance matrix of graphs with more general matrix weights
- Distance spectra and distance energy of integral circulant graphs
- Dynamic resource location with tropical algebra
- The effect of graft transformations on distance signless Laplacian spectral radius
- Query complexity of sampling and small geometric partitions
- Inverse of the distance matrix of a weighted cactoid digraph
- Decompositions of complete multigraphs related to Hadamard matrices
- Recognizing binary Hamming graphs inO(n 2 logn) time
- A q -analogue of the distance matrix of a tree with matrix weights
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii
- The distance spectrum of two new operations of graphs
- Graphs with three distinct distance eigenvalues
- The generalized distance spectrum of a graph and applications
- 4-hyperclique decompositions of 3-hyperdistance multihypergraphs of multipartite graphs
- On the first two largest distance Laplacian eigenvalues of unicyclic graphs
- A tree whose complement is not eigensharp
- On the distance Laplacian spectral radius of graphs
- Graphs whose distance matrix has at most three negative eigenvalues
- On the distance and distance Laplacian eigenvalues of graphs
- Regarding two conjectures on clique and biclique partitions
- On covering graphs by complete bipartite subgraphs
- On the locating chromatic number of Kneser graphs
- On the distance matrix of a directed graph
- Isometric embedding in products of complete graphs
- The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
- Decomposing the complete \(r\)-graph
- Improved bounds for the Graham-Pollak problem for hypergraphs
- Eigenvalues of Cayley graphs
- A short note on a short remark of Graham and Lovász
- On Cartesian product of Euclidean distance matrices
- Graph families with constant distance determinant
- An explicit formula for the distance characteristic polynomial of threshold graphs
- Mixed dominating matrices
- \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
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)