All Stories

  1. The median of Sierpiński triangle graphs
  2. Weakly Modular Graphs with Diamond Condition, the Interval Function and Axiomatic Characterizations
  3. First order non-definability of some transit functions on graphs
  4. Characterization of the Center Function on Barbell Graphs and (m, n)-lollipops using Universal Axioms
  5. Helly Number, Radon Number and Rank in $$\varDelta $$-Convexity on Graphs
  6. Convex geometries yielded by transit functions
  7. The axiomatic characterization of the interval function of distance hereditary graphs
  8. The median function of a block graph: Axiomatic characterizations
  9. The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability
  10. Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
  11. First-order logic with metric betweenness – the case of non-definability of some graph classes
  12. Axiomatic Characterization of the Toll Walk Function of Some Graph Classes
  13. Segment Transit Function of the Induced Path Function of Graphs and Its First-Order Definability
  14. Comparability Graphs Among Cover-Incomparability Graphs
  15. Ptolemaic and Chordal Cover-Incomparability Graphs
  16. Ptolemaic and Planar Cover-incomparability Graphs
  17. Axiomatic Characterization of the Median Function of a Block Graph
  18. Cut Vertex Transit Functions of Hypergraphs
  19. Lexicographic Product of Digraphs and Related Boundary-Type Sets
  20. Axiomatic characterization of the interval function of a bipartite graph
  21. Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
  22. Transit sets of -point crossover operators
  23. Characterization of general position sets and its applications to cographs and bipartite graphs
  24. Betweenness in graphs: A short survey on shortest and induced path betweenness
  25. Boundary Vertices of Cartesian Product of Directed Graphs
  26. Towards prediction of paradigm shifts from scientific literature
  27. An integrated approach to path analysis for weighted citation networks
  28. Axiomatic characterization of the center function. The case of non-universal axioms
  29. axiomatic characterization of the interval function of a disconnected graph
  30. The Edge Geodetic Number of Product Graphs
  31. Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
  32. Axiomatic characterization of the center function. The case of universal axioms
  33. Network approach for stock market data mining and portfolio analysis
  34. Axiomatic Characterization of the Interval Function of a Bipartite Graph
  35. Contextual productivity assessment of authors and journals: a network scientometric approach
  36. Scenario-based forecasting on commercial potential of SDHWS
  37. On Gated Sets in Graphs
  38. Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions
  39. On the Center Sets of Some Graph Classes
  40. The Induced Path Transit Function and the Pasch Axiom
  41. The median game
  42. Centrality and Flow Vergence gradient based Path analysis of scientific literature: A case study of Biotechnology for Engineering
  43. Axiomatic characterization of the interval function of a block graph
  44. Detection of paradigm shifts and emerging fields using scientific network: A case study of Information Technology for Engineering
  45. Algorithms for the remoteness function, and the median and antimedian sets in ℓ<SUB align="right">1-graphs
  46. Affiliations network analysis in scientific citations: A case study of information technology for engineering
  47. COVER-INCOMPARABILITY GRAPHS AND 2-COLORED DIAGRAMS OF POSETS*
  48. Cographs Which are Cover-Incomparability Graphs of Posets
  49. Equal opportunity networks, distance-balanced graphs, and Wiener game
  50. A forbidden subgraph characterization of some graph classes using betweenness axioms
  51. Atoms and clique separators in graph products
  52. A note on 3-Steiner intervals and betweenness
  53. Convex Sets in Lexicographic Products of Graphs
  54. Cover-incomparability graphs and chordal graphs
  55. The induced path function, monotonicity and betweenness
  56. Simultaneous embeddings of graphs as median and antimedian subgraphs
  57. On the remoteness function in median graphs
  58. Steiner intervals, geodesic intervals, and betweenness
  59. Strongly distance-balanced graphs and graph products
  60. Triangle path transit functions, betweenness and pseudo-modular graphs
  61. Cover-Incomparability Graphs of Posets
  62. The median function on graphs with bounded profiles
  63. Computing median and antimedian sets in median graphs
  64. Convexities related to path properties on graphs
  65. Interval function of graphs
  66. Identifying and predicting behaviour outcomes in cancer patients undergoing curative treatment
  67. Induced Path Transit Function, Betweenness and Monotonicity
  68. The All-Paths Transit Function of a Graph