The following pages link to (Q4523707):
Displaying 50 items.
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs (Q952061) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- On wreathed lexicographic products of graphs (Q965985) (← links)
- On distance-balanced graphs (Q966128) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Distance-residual subgraphs (Q973137) (← links)
- A quasicancellation property for the direct product of graphs (Q973141) (← links)
- Wide diameter of Cartesian graph bundles (Q973142) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Products of unit distance graphs (Q973156) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- Hyper- and reverse-Wiener indices of F-sums of graphs (Q987696) (← links)
- Uniquely pairable graphs (Q998347) (← links)
- A characterization of planar partial cubes (Q998403) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Connectivity of Cartesian products of graphs (Q998569) (← links)
- The hyper-Wiener index of graph operations (Q1004823) (← links)
- The median function on graphs with bounded profiles (Q1005230) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh (Q1014414) (← links)
- Hadwiger number and the Cartesian product of graphs (Q1014821) (← links)
- PI polynomials of product graphs (Q1023091) (← links)
- Strongly distance-balanced graphs and graph products (Q1024301) (← links)
- The edge fault-diameter of Cartesian graph bundles (Q1024302) (← links)
- Subdivided graphs as isometric subgraphs of Hamming graphs (Q1024304) (← links)
- Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- Proof of a conjecture concerning the direct product of bipartite graphs (Q1024310) (← links)
- Approximate graph products (Q1024311) (← links)
- Lattice embeddings of trees (Q1024313) (← links)
- Vizing's conjecture for chordal graphs (Q1024500) (← links)
- On \(\Sigma\) and \(\Sigma'\) labelled graphs (Q1024510) (← links)
- Netlike partial cubes II. Retracts and netlike subgraphs (Q1025452) (← links)
- On direct product cancellation of graphs (Q1025517) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- The first and second Zagreb indices of some graph operations (Q1028477) (← links)
- A note on the connectivity of Kronecker products of graphs (Q1033021) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- \(L(2,1)\)-labeling of strong products of cycles (Q1041747) (← links)
- On the ultimate lexicographic Hall-ratio (Q1043566) (← links)
- Transitive, locally finite median graphs with finite blocks (Q1043799) (← links)
- Generalized symmetry of graphs - a survey (Q1044907) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Isometric embeddings of subdivided connected graphs into hypercubes (Q1045174) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Isometric embeddings of subdivided wheels in hypercubes (Q1402086) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
