The following pages link to (Q4523707):
Displaying 50 items.
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- Computing median and antimedian sets in median graphs (Q2379917) (← links)
- All good (bad) words consisting of 5 blocks (Q2403998) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Total edge irregularity strength of accordion graphs (Q2410103) (← links)
- Some bounds for total communicability of graphs (Q2418987) (← links)
- Total $k$-domination in strong product graphs (Q2420408) (← links)
- On the super domination number of lexicographic product graphs (Q2420416) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- A characterization of non-isometric binary words (Q2422216) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Graph kernels and Gaussian processes for relational reinforcement learning (Q2433177) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- On oriented graphs whose skew spectral radii do not exceed 2 (Q2435496) (← links)
- Walk entropies in graphs (Q2438485) (← links)
- On prisms, Möbius ladders and the cycle space of dense graphs (Q2441654) (← links)
- Nicely distance-balanced graphs (Q2441948) (← links)
- Tree-like partial Hamming graphs (Q2442273) (← links)
- The graph matching problem (Q2444585) (← links)
- Computing the eccentric-distance sum for graph operations (Q2446873) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- A characterization of the interval distance monotone graphs (Q2455586) (← links)
- Cancellation properties of products of graphs (Q2457017) (← links)
- Fast recognition of Fibonacci cubes (Q2461540) (← links)
- Partial cubes are distance graphs (Q2470449) (← links)
- The fault-diameter of Cartesian products (Q2474266) (← links)
- \(\Theta\)-graceful labelings of partial cubes (Q2497465) (← links)
- On induced and isometric embeddings of graphs into the strong product of paths (Q2497473) (← links)
- On the extension of vertex maps to graph homomorphisms (Q2501538) (← links)
- Distance-balanced graphs: symmetry conditions (Q2501561) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- On semicube graphs (Q2519790) (← links)
- On median nature and enumerative properties of Fibonacci-like cubes (Q2568482) (← links)
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs (Q2573719) (← links)
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) (← links)
- On the canonical metric representation, average distance, and partial Hamming graphs (Q2581459) (← links)
- The third and hyper-Zagreb coindices of some graph operations (Q2634341) (← links)
- Fibonacci-run graphs. I: Basic properties (Q2661218) (← links)
- Cops and an insightful robber (Q2661223) (← links)
- The 2-domination number of cylindrical graphs (Q2678854) (← links)
- Clusters in Markov chains via singular vectors of Laplacian matrices (Q2680586) (← links)
- Comparison between Merrifield-Simmons index and Wiener index of graphs (Q2684801) (← links)
- The first general Zagreb coindex of graph operations (Q2690757) (← links)
- Strongly Projective Graphs (Q3153537) (← links)
- Corona graphs as a model of small-world networks (Q3302161) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- (Q3410616) (← links)
- Cubes polynomial and its derivatives (Q3438944) (← links)
- Weak k-reconstruction of cartesian product graphs (Q3439000) (← links)
