The following pages link to (Q4350166):
Displaying 50 items.
- Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family (Q82973) (← links)
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Cospectral digraphs from locally line digraphs (Q272341) (← links)
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- \(H\)-\(V\)-super magic decomposition of complete bipartite graphs (Q324968) (← links)
- \(H\)-\(E\)-super magic decomposition of complete bipartite graphs (Q324984) (← links)
- On Cayley graphs of completely 0-simple semigroups (Q352750) (← links)
- Two conjectures on graceful digraphs (Q354413) (← links)
- Graph operations and neighbor rupture degree (Q364548) (← links)
- Colorful polytopes and graphs (Q375685) (← links)
- On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles (Q383048) (← links)
- Forbidden induced subgraphs for near perfect matchings (Q385401) (← links)
- On bi-regular cages of even girth at least 8 (Q387618) (← links)
- On the order of graphs with a given girth pair (Q394547) (← links)
- Forbidden induced subgraphs for star-free graphs (Q409360) (← links)
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
- Graphs with maximum size and lower bounded girth (Q427676) (← links)
- Radial Moore graphs of radius three (Q427891) (← links)
- Some results on decomposable and reducible graph properties (Q442353) (← links)
- The edge spectrum of the saturation number for small paths (Q442392) (← links)
- Locating pairs of vertices on Hamiltonian cycles (Q442398) (← links)
- Colorful associahedra and cyclohedra (Q472171) (← links)
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling (Q478946) (← links)
- Generalizing vertex pancyclic and \(k\)-ordered graphs (Q497349) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- Some special minimum \(k\)-geodetically connected graphs (Q548276) (← links)
- Bounds on the total restrained domination number of a graph (Q604651) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) (Q608265) (← links)
- New results on EX graphs (Q626971) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Monotonicity of the order of \((D;g)\)-cages (Q654223) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- The graphicahedron (Q709258) (← links)
- Lower negative decision number in a graph (Q711530) (← links)
- A new bound for the connectivity of cages (Q712582) (← links)
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
- Isomorphism conditions for Cayley graphs of rectangular groups (Q726498) (← links)
- Note on \(E\)-super vertex magic graphs (Q741548) (← links)
- On the connectivity and restricted edge-connectivity of 3-arc graphs (Q741721) (← links)
- Witness rectangle graphs (Q742595) (← links)
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625) (← links)
- Some bistar bipartite Ramsey numbers (Q742632) (← links)
- Characterization of eccentric digraphs (Q819811) (← links)
- Domination number in graphs with minimum degree two (Q839753) (← links)
- Lower bounds on the vertex-connectivity of digraphs and graphs (Q845669) (← links)
- Multipartite Moore digraphs (Q854866) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
