Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAKCE International Journal of Graphs and Combinatorics, Volume 12
Volume 12, Number 1, July 2015
- Bryan Ek, Caitlin VerSchneider, Darren A. Narayan:
Global efficiency of graphs. 1-13 - Muhammad Javaid
:
Super (a, d)-EAT labeling of subdivided stars. 14-18 - M. R. Chithra, Ambat Vijayakumar:
Domination criticality in product graphs. 19-25 - Christopher A. Wood, Jobby Jacob:
A complete L(2, 1) span characterization for small trees. 26-31 - Rigoberto Flórez, Darren A. Narayan:
Maximizing the number of edges in optimal k-rankings. 32-39 - Gee-Choon Lau, Saeid Alikhani, Sin-Min Lee, William L. Kocay:
On k-edge-magic labelings of maximal outerplanar graphs. 40-46 - Ashok Kumar Das, Ritapa Chakraborty:
New characterizations of proper interval bigraphs. 47-53 - S. David Laurence, KM. Kathiresan:
On super (a, d)-Ph-antimagic total labeling of Stars. 54-58 - Ramadan A. El-Shanawany, Mahmoud Shibl Higazy, Hanan Shabana, Ahmed Ibrahim El-Mesady:
Cartesian product of two symmetric starter vectors of orthogonal double covers. 59-63 - Rao Li:
Harary index and some Hamiltonian properties of graphs. 64-69 - Midori Kobayashi, Keiko Kotani, Nobuaki Mutoh, Gisaku Nakamura:
Uniform coverings of 2-paths with 4-cycles. 70-73
Volume 12, Numbers Issues 2-3, November 2015
- Nobuo Nakagawa:
On equations of finite fields of characteristic 2 and APN functions. 75-93 - Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez:
The Fibonacci numbers of certain subgraphs of circulant graphs. 94-103 - Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Cycles and transitivity by monochromatic paths in arc-coloured digraphs. 104-112 - Alex Collins, Colton Magnant, Hua Wang:
Tight super-edge-graceful labelings of trees and their applications. 113-118 - Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Independent and monochromatic absorbent sets in infinite digraphs. 119-123 - Hortensia Galeana-Sánchez, Micael Toledo:
New classes of panchromatic digraphs. 124-132 - B. Devadas Acharya, Purnima Gupta, Deepti Jain:
On graphs whose graphoidal domination number is one. 133-140 - Shariefuddin Pirzada, Hilal A. Ganie:
On the construction of L-equienergetic graphs. 141-154 - Teresa W. Haynes, Stephen T. Hedetniemi, Inna Vasylieva:
Very cost effective bipartitions in graphs. 155-160 - Ali Ahmad, Misbah Arshad, Gabriela Izaríková:
Irregular labelings of helm and sun graphs. 161-168 - T. Tamizh Chelvam, Krishnan Selvakumar, V. Ramanathan:
On the planarity of the k-zero-divisor hypergraphs. 169-176 - Masoud Karimi:
On the girth of regular digraph of ideals of an Artinian ring. 177-179 - Khee Meng Koh, L. Y. Phoon, Kian Wee Soh:
The gracefulness of the join of graphs (II). 180-185 - Gopalapillai Indulal, Dragan Stevanovic:
The distance spectrum of corona and cluster of two graphs. 186-192 - Joseph A. Gallian, Danielle Stewart:
Properly even harmonious labelings of disconnected graphs. 193-203 - Joseph A. Gallian, Danielle Stewart:
Even harmonious labelings of disjoint graphs with a small component. 204-215 - R. Alagammai, V. Vijayalakshmi:
Game chromatic number of lexicographic product graphs. 216-220 - S. S. Rukmani, V. Vijayalakshmi:
On multiplicity of quadrilaterals. 221-223 - R. Ponraj, S. Sathish Narayanan, R. Kala:
Radio mean labeling of a graph. 224-228 - Daniel Khoshnoudirad, Hugues Talbot:
A complete characterization of the (m, n)-cubes and combinatorial applications in imaging, vision and discrete geometry. 229-237
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-19 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
