„Graphs“

Suchergebnisse

10.000+ Treffer

• Generalization of restrained triple connected outer perfect domination number for square of grid graphs
  Priya, K. ; Mahadevan, G. ; Sivagnanam, C.
• A pairing formula for resonant states on finite regular graphs
  Arends, Christian ; Frahm, Jan ; Hilgert, Joachim
• Faster Diameter Computation in Graphs of Bounded Euler Genus
  Kluk, Kacper ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Stamoulis, Giannos 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5
  Dupré la Tour, Max ; Lafond, Manuel ; Ndiaye, Ndiamé ; Vetta, Adrian 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Spectra of M-bicone complement product of graphs
  Pavithra, R. ; Rajkumar, R.
• Domination and its variants in split graphs -P versus NPC dichotomy
  Mohanapriya, A. ; Renjith, P. ; Sadagopan, N.
• Some algorithmic results on hamiltonicity and its variants in $$P_6$$ P 6 -free graphs
  Kumar, R. Mahendra ; Sadagopan, N.
• A study of plithogenic graphs: applications in spreading coronavirus disease (COVID-19) globally
  Sultana, Fazeelat ; Gulistan, Muhammad ; Ali, Mumtaz ; Yaqoob, Naveed ; Khan, Muhammad ; Rashid, Tabasam ; Ahmed, Tauseef
• Energy of strong double graphs
  Ramane, Harishchandra S. ; Parvathalu, B. ; Ashoka, K.
• Distance between the spectra of certain graphs
  Alinezhad, Mohsen ; Khashyarmanesh, Kazem ; Afkhami, Mojgan
• On the number of connected subgraphs of graphs
  Pandey, Dinesh ; Patra, Kamal Lochan
• The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
  Fan, Dandan ; Wang, Guoping
• Parameterized Dynamic Data Structure for Split Completion
  Majewski, Konrad ; Pilipczuk, Michał ; Zych-Pawlewicz, Anna 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ON FINITE PRIME DISTANCE GRAPHS
  Parthiban, A. ; Samdanielthompson, G. ; Kumar, K. Sathish
• Various energies of commuting graphs of some super integral groups
  Dutta, Parama ; Nath, Rajat Kanti
• Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
  Langedal, Kenneth ; Hespe, Demian ; Sanders, Peter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Spectrum of anti-gallai graph of some graphs
  Palathingal, Jeepamol J. ; Lakshmanan, Aparna S. ; Indulal, Gopalapillai
• The spectrum of some generalized graphs related to cycle
  Scaria, Deena C. ; Indulal, G.
• New parameter of inverse domination in graphs
  Abdlhusein, Mohammed A. ; Al-Harere, Manal N.
• Testing Spreading Behavior in Networks with Arbitrary Topologies
  Modanese, Augusto ; Yoshida, Yuichi 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik