default search action
Electronic Notes in Discrete Mathematics, Volume 63
Volume 63, December 2017
- Deepa Sinha, Thomas Zaslavsky, Gyula O. H. Katona, Tao-Ming Wang:
Preface. 1-2 - Thomas Zaslavsky:
Forbidden Induced Subgraphs. 3-10 - Mukti Acharya:
C-Cordial Labeling in Signed Graphs. 11-22 - Andreas M. Hinz:
Open Problems for Hanoi and Sierpiński Graphs. 23-31 - Tao-Ming Wang, Guang-Hui Zhang:
On Edge-Graceful Regular Graphs with Particular 3-Factors. 33-40 - Thomas Zaslavsky:
Negative Circles in Signed Graphs: A Problem Collection. 41-47 - Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Bounds for the sum choice number. 49-58 - Thangaraj Asir
, T. Tamizh Chelvam
Genus of total graphs of commutative rings: A survey. 59-68 - Rajendran Rajkumar
Reduced power graph of a group. 69-76 - Devendra Lad, P. Venkata Subba Reddy
Complexity Issues of Variants of Secure Domination in Graphs. 77-84 - Devsi Bantva
Further results on the radio number of trees. 85-91 - Devsi Bantva
Radio number for middle graph of paths. 93-100 - Mahdi Amani
New Terminology and Results for AVL Trees. 101-108 - Mark Korenblit, Vadim E. Levit
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs. 109-116 - Pankaj Kumar Das
Location of Multiple Sub-Blocks with Burst Errors. 117-123 - Vinod Kumar Mishra, Pankaj Singh Sammal:
Utilization of OpenCL for Large Graph Problems on Graphics Processing Unit. 125-135 - Sriparna Chattopadhyay, Pratima Panigrahi:
On Sum of Powers of the Laplacian Eigenvalues of Power Graphs of Certain Finite Groups. 137-143 - Kannan Pattabiraman:
Degree and Distance Based Topological Indices of Graphs. 145-159 - Harishchandra S. Ramane
Degree exponent polynomial of graphs obtained by some graph operations. 161-168 - Prabhakar R. Hampiholi, Jotiba P. Kitturkar:
On Enumeration of Some Non-isomorphic Edge Complete Semigraphs. 169-176 - Biswajit Deb
A characterization of biconnected graphs reachable by robots jumping over m obstacles. 177-187 - Sarifa Khatun, Sk. Md. Abu Nayeem
Graceful labeling of some zero divisor graphs. 189-196 - A. K. Bhuniya, Sajal Kumar Mukherjee:
On the power graph of the direct product of two groups. 197-202 - Arti Pandey, B. S. Panda:
Restrained Domination in Some Subclasses of Chordal Graphs. 203-210 - K. Raja Chandrasekar
Edge irredundant colorings in graphs. 211-218 - Sasmita Barik, Gopinath Sahoo
Some results on the Laplacian spectra of graphs with pockets. 219-228 - H. P. Patil, V. Raja:
Structure of wheel-trees with colourings and domination numbers. 229-236 - Mahipal Jadeja
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. 237-244 - Sajal Kumar Mukherjee, A. K. Bhuniya:
An elementary proof of a conjecture on Graph-Automorphism. 245-250 - Kannan Pattabiraman, M. Vijayaragavan:
Edge a-Zagreb Indices and its Coindices of Transformation Graphs. 251-269 - Meenakshi Wasadikar, Amit Dabhole
Incomparability graphs of the lattices Ln and. 271-278 - Angshu Kumar Sinha
Signed Edge Domination Number of Interval Graphs. 279-286 - Sunil Kumar R., Kannan Balakrishnan:
Betweenness Centrality in Cartesian Product of Graphs. 287-294 - Sunil Kumar R., Kannan Balakrishnan:
On the number of geodesics of Petersen graph GP(n, 2). 295-302 - Ruhul Amin
Trees with minimum F-coindex. 303-310 - Aloysius Godinho, Tarkeshwar Singh:
Some Distance Magic Graphs. 311-315 - Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh:
Distance Antimagic Labeling of the Ladder Graph. 317-322 - Deepa Sinha, Anshu Sethi:
An Algorithmic Characterization of Splitting Signed Graph. 323-332 - Priyanka Singh, Pratima Panigrahi:
On self-centeredness of tensor product of some graphs. 333-342 - Nibedita Mandal
L(2, 1)-colorings and Irreducible No-hole Colorings of Cartesian Product of Graphs. 343-352 - Pallavi Jain, Gur Saran, Kamal Srivastava:
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. 353-360 - I. Sahul Hamid
Criticality of outer - connected independence upon edge removal. 361-369 - Jessie Abraham
Layout of embedding locally twisted cube into the extended theta mesh topology. 371-379 - Yogita Singh Kardam, Kamal Srivastava, Reeti Sharma:
Minimizing Profile of Graphs Using a Hybrid Simulating Annealing Algorithm. 381-388 - Mukti Acharya, Pranjali, Atul Gaur, Amit Kumar:
Line Signed Graph of a Signed Total Graph. 389-397 - Y. S. Gaidhani, Charusheela M. Deshpande, Bhagyashree Athawale:
Adjacency Matrix of a Semigraph. 399-406 - P. C. Lisna, M. S. Sunitha:
b-Chromatic Sum of Mycielskian of Paths. 407-414 - Sameeha Rehmani, M. S. Sunitha:
Minimum Geodetic Fuzzy Subgraph. 415-424 - Deepa Sinha, Ayushi Dhama:
Unitary Cayley Meet Signed Graphs. 425-434 - A. T. Shahida, M. S. Sunitha:
On the Metric Dimension of Join of a Graph with Empty Graph(Op). 435-445 - Jeepamol J. Palathingal, S. Aparna Lakshmanan
Gallai and anti-Gallai Graph Operators. 447-453 - Deepa Sinha, Deepakshi Sharma:
Transitivity Model on Signed Graphs. 455-460 - Mukti Acharya, Rashmi Jain, Sangita Kansal:
Vertex equitable labeling of signed graphs. 461-468 - Rashmi Jain, Sangita Kansal, Mukti Acharya:
-consistent and -cycle compatible dot-line signed graphs. 469-478 - Ron Aharoni, Eli Berger, Dani Kotlar
Topological methods for the existence of a rainbow matching. 479-484 - Sheela Suthar, Om Prakash
Energy and Wiener index of Total Graph over Ring. 485-495 - Deepa Sinha, Anita Kumari Rao:
On Co-maximal Meet Signed Graphs of Commutative Rings. 497-502 - Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu
On the Grundy number of Cameron graphs. 503-516 - Deepa Sinha, Deepakshi Sharma, Bableen Kaur
Signed Zero-Divisor Graph. 517-524 - Kushal Kanwar, Harish Kumar, Sakshi Kaushal:
A Metric to Compare Vulnerability of the Graphs of Different Sizes. 525-533
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 2025-01-10 18:23 CET 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: