All Stories

  1. Strong geodetic problems in networks
  2. The Graph Theory General Position Problem on Some Interconnection Networks
  3. A GENERAL POSITION PROBLEM IN GRAPH THEORY
  4. Strong edge geodetic problem in networks
  5. A note on the locating-total domination in graphs
  6. Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs
  7. A detection for patent infringement suit via nanotopology induced by graph
  8. A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
  9. Maximum incomplete recursive circulants in graph embeddings
  10. Berge–Fulkerson Conjecture on Certain Snarks
  11. On the Strong Metric Dimension of Tetrahedral Diamond Lattice
  12. A Lower Bound for Dilation of an Embedding
  13. A Tight Bound for Congestion of an Embedding
  14. Embedding Circulant Networks into Butterfly and Benes Networks
  15. Embeddings Between Hypercubes and Hypertrees
  16. On the metric dimension of circulant and Harary graphs
  17. Excessive Index of Certain Nanotubes
  18. On the partition dimension of a class of circulant graphs
  19. A New Technique to Compute Padmakar-Ivan Index and Szeged Index of Pericondensed Benzenoid Graphs
  20. Metric dimension of directed graphs
  21. Computing Total-Szeged Index of Nanostar Dendrimer NSC5 C6
  22. A New Approach to Compute Wiener Index
  23. A trust model of cloud computing based on Quality of Service
  24. EXCESSIVE INDEX OF CERTAIN CHEMICAL STRUCTURES
  25. Challenges, strategies and metrics for supply-driven enterprises
  26. Total-Szeged Index of C4-Nanotubes, C4-Nanotori and Dendrimer Nanostars
  27. Wirelength of hypercubes into certain trees
  28. Minimum wirelength of hypercubes into n-dimensional grid networks
  29. Replication based fault tolerant job scheduling strategy for economy driven grid
  30. EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2
  31. CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS
  32. Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
  33. Wirelength of 1-fault hamiltonian graphs into wheels and fans
  34. Broadcasting Algorithms of Carbon Nanotubes
  35. Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
  36. Computational Aspects of Carbon and Boron Nanotubes
  37. Empirical performance evaluation of schedulers for cluster of workstations
  38. Enhanced GridSim architecture with load balancing
  39. A hybrid fault tolerance technique in grid computing system
  40. Trust management system for grid and cloud resources
  41. Exact wirelength of hypercubes on a grid
  42. Topological properties of silicate networks
  43. Adaptive checkpointing strategy to tolerate faults in economy based grid
  44. A perishable inventory system with service facilities and retrial customers
  45. On minimum metric dimension of honeycomb networks
  46. An efficient representation of Benes networks and its applications
  47. A perishable inventory system with service facilities, MAP arrivals and PH — Service times
  48. Perishable Inventory System with Postponed Demands and Negative Customers
  49. Adaptive pre-task assignment scheduling strategy for heterogeneous distributed raytracing system
  50. Landmarks in torus networks
  51. Embedding of cycles and wheels into arbitrary trees
  52. Embedding of Generalized Wheels into Arbitrary Trees
  53. A data-centric design for n-tier architecture
  54. Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs
  55. Products of three triangular matrices over commutative rings
  56. Products of three triangular matrices
  57. A characterization of strongly chordal graphs
  58. Maximum h-colourable subgraph problem in balanced graphs
  59. Transversal partitioning in balanced hypergraphs
  60. A monotone method for the equation uxyz=f
  61. Existence of monotone solutions for functional differential equations
  62. Monotone iterative scheme for nonlinear hyperbolic boundary value problem
  63. Quasi-solutions and monotone method for infinite systems of nonlinear boundary value problems