Results 271 to 280 of about 750,580 (290)
Some of the next articles are maybe not open access.

The Achromatic and b-chromatic Number of Shadow Graph of some Graphs

Asian Journal of Research in Social Sciences and Humanities, 2017
In this research work the achromatic and b-chromatic number of central graph of shadow graph of cycle and that of complete bipartite graph are studied. The achromatic and b-chromatic number of central graph of Shadow graph of star graphs are deduced from the results of the complete bi partite graph.
K. P. Thilagavathy, A. Santha
openaire   +1 more source

Revised Scheme for Antimagic Graph Labeling for Splitting Graph and Shadow Graph Associated With Cycle

2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT), 2019
Antimagic graph labeling is the allotment of positive numbers to the edges of a graph such that the sum of graph edge labels incident to each node varies. The paper emphasizes on strong antimagic graph labeling for splitting graph and shadow graph of cycle.
Zareen Tasneem
exaly   +2 more sources

The power of graph transformation - implementing a Shadow Casting algorithm

2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics, 2012
Nowadays model transformation is used frequently in software development. Therefore, its effectiveness and usability have a big influence on the whole development phase. The attributes of the model transformation are mainly determined by the applied model transformation language.
Péter Fehér, László Lengyel
openaire   +2 more sources

On the eigenvalues of closed shadow graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Francis Joseph H. Campeña   +2 more
openaire   +1 more source

Roman Domination in the Shadow Distance Graphs

Communications in Mathematics and Applications, 2023
K. Kallesh   +2 more
openaire   +1 more source

HMC Labeling of Some Special Graphs and Some Shadow Graphs

Communications on Applied Nonlinear Analysis
All the graphs considered in this article are simple and undirected. Let  be a simple undirected Graph. A function    is called Harmonic Mean Cordial if the induced function   defined by   satisfies the condition    and   for any , where   and   denotes the number of vertices and number of edges with label  respectively and   denotes the greatest ...
openaire   +1 more source

Shadow-Graph and Schlieren Methods in Auditorium Modeling

The Journal of the Acoustical Society of America, 1971
The shadow-graph method in the classical form used by W. C. Sabine seems better suited to wavefront photography in models of auditoriums than the more complex schlieren method. The former produces photographs in which the optical density is proportional to the density of disturbance within the model; the latter produces photographs that are sensitive ...
openaire   +1 more source

Distance magic labeling on shadow graphs

AIP Conference Proceedings, 2022
Chaithra Krishna, Shankaran Perikamana
openaire   +1 more source

Computational and Structural Aspects of the Geodetic and the Hull Numbers of Shadow Graphs

Discrete Applied Mathematics, 2022
Mitre C Dourado   +2 more
exaly  

Automated Detection of Buildings From Single VHR Multispectral Images Using Shadow Information and Graph Cuts

ISPRS Journal of Photogrammetry and Remote Sensing, 2013
Ali Özgün Ok
exaly  

Home - About - Disclaimer - Privacy