On the Addressing Problem for Loop Switching
From MaRDI portal
Publication:5636776
DOI10.1002/j.1538-7305.1971.tb02618.xzbMath0228.94020OpenAlexW2785506964MaRDI QIDQ5636776
H. O. Pollak, Ronald L. Graham
Publication date: 1971
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1971.tb02618.x
Related Items
On the Decomposition of Graphs, Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree, The generalized distance spectrum of a graph and applications, Distance matrix of a multi-block graph: determinant and inverse, Tiled partial cubes, Resistance matrices of balanced directed graphs, Unnamed Item, Unnamed Item, On Problem of Finding all Maximal Induced Bicliques of Hypergraph, A problem on distance matrices of subsets of the Hamming cube, Unnamed Item, Dominating sets in n‐cubes, Product graph representations, Recognizing binary Hamming graphs inO(n 2 logn) time, An inverse formula for the distance matrix of a fan graph, The bipartite Laplacian matrix of a nonsingular tree, On the distance energy of \(k\)-uniform hypergraphs, On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets, The sum of the \(k\) largest distance eigenvalues of graphs, Distance matrices of a tree: two more invariants, and in a unified framework, Quadratic embedding constants of graphs: bounds and distance spectra, Hypercube embeddings and Cayley graphs generated by transpositions, Minimizing the distance spectral radius of uniform hypertrees with given parameters, On the distance spectra ofm-generationn-prism graph, On the spectral radius and the energy of eccentricity matrices of graphs, A \(q\)-analogue of distance matrix of block graphs, Wiener index and addressing of some finite graphs, Network analysis with the aid of the path length matrix, An explicit formula for the distance characteristic polynomial of threshold graphs, Blowup polynomials and delta-matroids of graphs, Factorization and pseudofactorization of weighted graphs, Finding biclique partitions of co-chordal graphs, A proof of a conjecture on the distance spectral radius, Matching extension and distance spectral radius, Distance spectral radius of unicyclic graphs with fixed maximum degree, A critical probability for biclique partition of \(G_{n,p}\), First-order logic axiomatization of metric graph theory, A generalization of the Graham-Pollak tree theorem to Steiner distance, Query Complexity of Sampling and Small Geometric Partitions, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, New bounds on the distance Laplacian and distance signless Laplacian spectral radii, On Isometric Embeddings of Graphs, Edge even graceful labeling of torus grid graph, -cospectrality and -energy in cographs, ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS, Affine semigroup rings that are complete intersections, The distance spectral radius of trees, ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS, Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs, Unnamed Item, On a problem of Zaks, Unnamed Item, On the second largest distance eigenvalue, Decomposition of Random Graphs into Complete Bipartite Graphs, On the distance matrix of a directed graph, Unnamed Item, On distance spectral radius of hypergraphs, Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs, Squared distance matrix of a tree: inverse and inertia, On the distance and distance Laplacian eigenvalues of graphs, THE SECOND IMMANANT OF SOME COMBINATORIAL MATRICES, The distance spectrum of two new operations of graphs, On the distance spectral radius of digraphs with given diameter, Distance spectral radii of k-uniform hypertrees with given parameters, On distance and Laplacian matrices of trees with matrix weights, Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights, Spectral theory of products of digraphs, Isometric subgraphs of Hamming graphs and d-convexity, On set intersection representations of graphs, Unnamed Item, On distance Laplacian and distance signless Laplacian eigenvalues of graphs, Unnamed Item, The distance Laplacian and distance signless Laplacian spectrum of the subdivision-vertex join and subdivision-edge join of two regular graphs, Squared distance matrix of a weighted tree, Distance matrix of weighted cactoid-type digraphs, The metric dimension & distance spectrum of non-commuting graph of dihedral group, Regarding two conjectures on clique and biclique partitions, Convex excess in partial cubes, Computing the determinant of the distance matrix of a bicyclic graph, Eigenvalues of Cayley graphs, Unnamed Item, Application of cut polyhedra. I, Unnamed Item, On the rank of the distance matrix of graphs, On the Wiener index, distance cospectrality and transmission-regular graphs, A relation between proximity and the third largest distance eigenvalue of a graph, Helge Tverberg is eighty: a personal tribute, The normalized distance Laplacian, Distance spectral radius of trees with given number of segments, Resistance matrices of graphs with matrix weights, The ancestral matrix of a rooted tree, Bounds on the \(\alpha \)-distance energy and \(\alpha \)-distance Estrada index of graphs, Isometric embeddings of subdivided complete graphs in the hypercube, On partial cubes, well-graded families and their duals with some applications in graphs, More on the Bipartite Decomposition of Random Graphs, The first eigenvector of a distance matrix is nearly constant, Smith normal form of a distance matrix inspired by the four-point condition, On the binary and Boolean rank of regular matrices, On distance spectral radius of graphs, Distance spectral radius of trees with fixed number of pendent vertices, Isometric Hamming embeddings of weighted graphs, Graphs with three distinct distance eigenvalues, The exponential distance matrix of block graphs, On distance spectral radius of graphs with given number of pendant paths of fixed length, On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs, On the determinant of \(q\)-distance matrix of a graph, Tree-like partial Hamming graphs, Complete multipartite graphs are determined by their distance spectra, Smith normal form of some distance matrices, The inertia and energy of distance matrices of complete \(k\)-partite graphs, A tree whose complement is not eigensharp, 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, Wiener index and addressing of the total graph, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, The bipartite distance matrix of a nonsingular tree, Which numbers are status differences?, On the distance and distance signless Laplacian spectral radii of tricyclic graphs, Distance eigenvalues and forwarding indices of circulants, The continuous multiple-modular design problem, 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, Addressing graph products and distance-regular graphs, The distance spectrum of complements of trees, Graphs whose distance matrix has at most three negative eigenvalues, A \(q\)-analogue of the distance matrix of a tree, Determinant of the distance matrix of a tree with matrix weights, Distance matrices of subsets of the Hamming cube, A simple proof of Graham and Pollak's theorem, On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices, Multicovering hypergraphs, A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph, The distance matrix of caterpillar, Nearly neighbourly families of standard boxes, Distance and distance signless Laplacian spread of connected graphs, The distance spectrum of a tree, Inverse of the distance matrix of a weighted cactoid digraph, Product distance matrix of a tree with matrix weights, On adjacency-distance spectral radius and spread of graphs, On rainbow-cycle-forbidding edge colorings of finite graphs, Eigenvalues and clique partitions of graphs, 2004 Summer Meeting of the Association for Symbolic Logic, On tope graphs of complexes of oriented matroids, On the distance spectral radius of trees with given degree sequence, The distance spectral radius of graphs with given number of odd vertices, Domination and Spectral Graph Theory, On the distance \(\alpha \)-spectral radius of a connected graph, On the distance spectrum of minimal cages and associated distance biregular graphs, Distance-preserving subgraphs of hypercubes, Bounds for the Graham-Pollak theorem for hypergraphs, Extremal results on distance Laplacian spectral radius of graphs, Distance spectrum, 1-factor and vertex-disjoint cycles, The Arithmetic Tutte polynomial of two matrices associated to Trees, The 2-Steiner distance matrix of a tree, Distance ideals of graphs, Edge even graceful labeling of polar grid graphs, The edge general position problem, The biclique covering number of grids, 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, Edge even graceful labeling of cylinder grid graph, Distance matrix and Laplacian of a tree with attached graphs, On graphs with near minimal distance energy, GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS, Isometric embedding of subdivided Connected graphs in the hypercube, On the distance Laplacian spectral radius of graphs, On the distance spectrum of distance regular graphs, Bipartite decomposition of random graphs, Graphs that are cospectral for the distance Laplacian, Clique partitions of the cocktail party graph, 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, Distance matrix of a class of completely positive graphs: determinant and inverse, The effect of graft transformations on distance signless Laplacian spectral radius, Non-deterministic communication complexity with few witnesses, Collapse of the metric hierarchy for bipartite graphs, On Cartesian product of Euclidean distance matrices, \(q\)-analogs of distance matrices of 3-hypertrees, Graph families with constant distance determinant, Addressing the Petersen graph, The distance spectrum and energy of the compositions of regular graphs, On the natural imprint function of a graph, Proximity, remoteness and distance eigenvalues of a graph, On the distance spectra of threshold graphs, Euclidean graph distance matrices of generalizations of the star graph, The distance matrix of a tree with weights on its arcs, Node-graceful graphs, Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs, Covering a graph by complete bipartite graphs, Isometric embeddings in Hamming graphs, The distance matrices of some graphs related to wheel graphs, Mixed dominating matrices, Decomposing the complete \(r\)-graph, On Euclidean distance matrices, Two Laplacians for the distance matrix of a graph, The inertia of distance matrices of some graphs, A short note on a short remark of Graham and Lovász, Biclique covers and partitions, Improved bounds for the Graham-Pollak problem for hypergraphs, On a symmetric representation of Hermitian matrices and its applications to graph theory, Quasi-median graphs, their generalizations, and tree-like equalities, Decompositions of complete multigraphs derived from Hadamard matrices, On the biclique cover of the complete graph, Convexity in partial cubes: the hull number, Isometric embeddings of subdivided wheels in hypercubes, On the complexity of testing a graph for n-cube, Inertia and biclique decompositions of joins of graphs, A note on distance spectral radius of trees, 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, Some graft transformations and its applications on the distance spectral radius of a graph, Fast recognition algorithms for classes of partial cubes, On distance spectral radius of uniform hypergraphs with cycles, Cubic inflation, mirror graphs, regular maps, and partial cubes, Inertia and distance energy of line graphs of unicyclic graphs, Projection of a medium, On least distance eigenvalue of uniform hypergraphs, Asymptotic number of isometric generalized Fibonacci cubes, Representations of graphs and networks (coding, layouts and embeddings), The inertia and energy of the distance matrix of a connected graph, Clique partitions of distance multigraphs, On tournament matrices, Multicolored forests in bipartite decompositions of graphs, On the first two largest distance Laplacian eigenvalues of unicyclic graphs, The inverse of the distance matrix of a distance well-defined graph, On the two largest distance eigenvalues of graph powers, Hamiltonian laceability of hypercubes without isometric subgraphs, Distance spectrum of Indu-Bala product of graphs, The changes in distance Laplacian spectral radius of graphs resulting from graft transformations, On eigensharp and almost eigensharp graphs, A shorter proof of the distance energy of complete multipartite graphs, On the decomposition of random hypergraphs, On biclique partitions of the complete graph, The de Bruijn-Erdős theorem for hypergraphs, On the immersion of digraphs in cubes, On cubical graphs, Dynamic resource location with tropical algebra, Identities for minors of the Laplacian, resistance and distance matrices, Embedding finite posets in cubes, On the distance matrix of a tree, Distance spectra and distance energy of integral circulant graphs, On distance matrices and Laplacians, A dynamic location problem for graphs, Finding bipartite subgraphs efficiently, Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix, The minimum rank of symmetric matrices described by a graph: a survey, Distance matrix polynomials of trees, Distance matrices on the \textit{H-join} of graphs: a general result and applications, Inverses of \(q\)-distance matrices of a tree, Distance spectral radius of uniform hypergraphs, On biclique decompositions of complete \(t\)-partite graphs, Characterizing the flow equivalent trees of a network, Decompositions of complete multigraphs related to Hadamard matrices, Subdivided graphs as isometric subgraphs of Hamming graphs, On covering graphs by complete bipartite subgraphs, Decomposition of the complete r-graph into complete r-partite r-graphs, On the locating chromatic number of Kneser graphs, On decompositions of complete hypergraphs, On verifying and engineering the wellgradedness of a union-closed family, Isometric embeddings of subdivided connected graphs into hypercubes, Another simple proof of Graham and Pollak's theorem, Isometric embedding in products of complete graphs, A new proof of a theorem of Graham and Pollak, Proof of the squashed cube conjecture, On the addressing problem for directed graphs, Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices, Laplacian matrices of graphs: A survey, On the distance spectra of graphs, On the resistance matrix of a graph, Ordering trees by their distance spectral radii
