Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Sliding column model for t-unit bar visibility representations of graphs: Label: en
  2. Order two element graph over a group: Label: en
  3. Properties of derived signed graphs on Beck’s zero-divisor graph: Label: en
  4. Essential self-adjointness of a weighted 3-simplicial complex Laplacians: Label: en
  5. On the double-critical graph conjecture: Label: en
  6. Some bounds on the size of maximum G-free sets in graphs: Label: en
  7. On the coefficients of skew Laplacian characteristic polynomial of digraphs: Label: en
  8. Weighted spectra on a weighted geometric realization of 2-simplexes and 3-simplexes: Label: en
  9. Equitable partition for some Ramanujan graphs: Label: en
  10. More on the outer connected geodetic number of a graph: Label: en
  11. A note on hyperopic cops and robber: Label: en
  12. On the Sα-matrix of graphs: Label: en
  13. Variation of Adriatic and Wiener indices for different cycle lengths and paths: Label: en
  14. Quotient NBCK-algebras: Label: en
  15. Magnetic cochains Laplacians and their essential self-adjointness: Label: en
  16. Detour global domination for splitting graph: Label: en
  17. Twin signed double Roman domination numbers in directed graphs: Label: en
  18. Domination in edge cycle graphs: Label: en
  19. Restrained Italian bondage number in graphs: Label: en
  20. Restrained domination polynomial of join and corona of graphs: Label: en
  21. Line-set domination in graphs: Label: en
  22. Quasi-cyclic and generalized quasi-cyclic codes and uniqueness of their generators: Label: en
  23. Inverse double Roman domination in graphs: Label: en
  24. Discrete representations of orbit structures of flows for topological data analysis: Label: en
  25. A note on Moore–Penrose inverse of Laplacian matrix of graphs: Label: en
  26. d-Gaussian Pell polynomials and their matrix representation: Label: en
  27. 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles: Label: en
  28. Global dominating broadcast in graphs: Label: en
  29. Algorithmic aspects of domination number in nano topology induced by graph: Label: en
  30. Secure equitability in graphs: Label: en
  31. Progress on fault-tolerant locating-dominating sets: Label: en
  32. Approaches that output infinitely many graphs with small local antimagic chromatic number: Label: en
  33. New results on quadruple Roman domination in graphs: Label: en
  34. On fourth leap Zagreb index of graphs: Label: en
  35. Total dominator coloring number of middle graphs: Label: en
  36. On some formulas in the problem of enumeration of finite labeled topologies: Label: en
  37. Vertex fault-tolerant spanners for weighted points in polygonal domains: Label: en
  38. The local complement metric dimension of graphs: Label: en
  39. Type-II polyadic constacyclic codes over finite fields: Label: en
  40. The generalized path matrix and energy: Label: en
  41. On normalized Laplacian eigenvalues of power graphs associated to finite cyclic groups: Label: en
  42. Indicated coloring of the Mycielskian of some families of graphs: Label: en
  43. Wiener index of sum of shadowgraphs: Label: en
  44. On the spectral radius of uniform weighted hypergraph: Label: en
  45. ℤ4R-additive cyclic and constacyclic codes and MDSS codes: Label: en
  46. Some results on generalized self-complementary graphs: Label: en
  47. The second-minimum and second-maximum values of exponential Zagreb indices among trees: Label: en
  48. Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles: Label: en
  49. Corona product of signed graphs and its application to modeling signed networks: Label: en
  50. Embedding and the rotational dimension of a graph containing a clique: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)