Results 71 to 80 of about 187,749 (326)

Upper and lower bounds based on linear programming for the b-coloring problem

EURO Journal on Computational Optimization, 2022
B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni, Xiaochen Chou, Derek H. Smith   +2 more
doaj   +1 more source

Fast, exact graph diameter computation with vertex programming [PDF]

, 2015
In graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, insomuch that approximation ...
Corey Pennycuff, Tim Weninger, Pennycuff, Corey, Weninger, Tim   +3 more
core   +1 more source

Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD

Advanced Materials, EarlyView.
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo, Masoud Mansouri, Carlos Garcia‐Fernandez, Daniel Sánchez‐Portal, Aran Garcia‐Lekue, Gustavo Ceballos, Aitor Mugarza   +6 more
wiley   +1 more source

Study of eccentricity based topological indices for benzenoid structure

South African Journal of Chemical Engineering, 2023
Topological indices play paramount role in defining chemical and structural properties of different compounds. Chemical graph theory is useful for predicting the bioactivity and physicochemical properties through numerical invariants.
Kamel Jebreen, Hifza Iqbal, Muhammad Haroon Aftab, Iram Yaqoob, Mohammed Issa Sowaity, Amjad Barham   +5 more
doaj   +1 more source

Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation

IEEE Transactions on Signal and Information Processing over Networks
Graph Signal Processing (GSP) provides a powerful framework for analysing complex, interconnected systems by modelling data as signals on graphs. While recent advances have enabled graph topology learning from observed signals, existing methods often struggle with time-varying systems and real-time applications. To address this gap, we introduce AdaCGP,
Alexander Jenkins, Thiernithi Variddhisaï, Ahmed El-Medany, Fu Siong Ng, Danilo P. Mandic   +4 more
openaire   +2 more sources

Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing

Advanced Materials, EarlyView.
Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria, Meng Yin, Stefan Neuhauser, Vlasis G. Mavrantzas, Ying Chen, Ken Suzuki, Andreas T. Güntner   +6 more
wiley   +1 more source

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

Barekeng
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati   +4 more
doaj   +1 more source

A SURVEY M-POLAR FUZZY GRAPHS [PDF]

Fiabilitate şi Durabilitate, 2019
I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj  

Jacobian Code Generated by Source Transformation and Vertex Elimination can be as Efficient as Hand-Coding [PDF]

, 2004
This article presents the first extended set of results from ELIAD, a source- transformation implementation of the vertex-elimination Automatic Differentiation approach to calculating the Jacobians of functions defined by Fortran code (Griewank and ...
Reid, John K., Mohamed Tadjouddine, Forth, Shaun A., John K. Reid, Pryce, John D., John D. Pryce, Shaun A. Forth, Tadjouddine, Mohamed   +7 more
core   +1 more source

Tailoring Phonon‐Driven Responses in α‐MoO3 through Isotopic Enrichment

Advanced Materials, EarlyView.
ABSTRACT The implementation of polaritonic materials into nanoscale devices requires selective tuning of parameters to realize desired spectral or thermal responses. One robust material, α‐MoO3, an orthorhombic crystal boasting three distinct phonon dispersions, provides three polaritonic dispersions of hyperbolic phonon polaritons (HPhPs) across the ...
Thiago S. Arnaud, Ryan W. Spangler, Johnathan D. Georgaras, Jonah B. Haber, Daniel Hirt, Maximilian Obst, Gonzalo Álvarez‐Pérez, Mackey Long III, Felix G. Kaps, Jakob Wetzel, Courtney Ragle, John E. Buchner, Youngji Kim, Aditha S. Senarath, Richarda Niemann, Mingze He, Giulia Carini, Unai Arregui‐Leon, Akash C. Behera, Ramachandra Bangari, Nihar Sahoo, Niels C. Brumby, J. Michael Klopf, Martin Wolf, Lukas M. Eng, Susanne C. Kehr, Thomas G. Folland, Alexander Paarmann, Patrick E. Hopkins, Felipe Jornada, Jon‐Paul Maria, Joshua D. Caldwell   +31 more
wiley   +1 more source