default search action
Electronic Journal of Graph Theory and Applications, Volume 7
Volume 7, Number 1, 2019
Articles
- Sin-Min Lee, Richard M. Low, Ho-Kuen Ng, Y.-C. Wang:
On friendly index sets of k-galaxies. 1-10 - Sarbari Mitra, Soumya Bhoumik:
Graceful labeling of triangular extension of complete bipartite graph. 11-30 - Modjtaba Ghorbani
, Mina Rajabi-Parsa:
On the Erdos-Ko-Rado property of finite groups of order a product of three primes. 31-42 - Sushobhan Maity, A. K. Bhuniya:
On the spectrum of linear dependence graph of a finite dimensional vector space. 43-59 - Michael Haythorpe
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. 61-75 - Nader Jafari Rad
On the complexity of some hop domination parameters. 77-89 - Shehnaz Akhter, Rashid Farooq:
Metric dimension of fullerene graphs. 91-103 - Hossein Teimoori Faal:
Clique roots of K4-free chordal graphs. 105-111 - Hilda Assiyatun
The connected size Ramsey number for matchings versus small disconnected graphs. 113-119 - Doost Ali Mojdeh
Outer independent global dominating set of trees and unicyclic graphs. 121-145 - Christin Otto, Peter Recht:
Maximum cycle packing using SPR-trees. 147-155 - Ngurah Anak Agung Gede, Rinovia Simanjuntak:
On the super edge-magic deficiency of join product and chain graphs. 157-167 - D. Pushparaj Shetty
Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network. 169-182 - Christian Rubio-Montiel
The 4-girth-thickness of the complete multipartite graph. 183-188 - Vladimir R. Rosenfeld:
The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles. 189-205
Volume 7, Number 2, 2019
Articles
- Rebecca E. Garcia
Block circulant graphs and the graphs of critical pairs of crowns. 207-216 - Noureddine Chikh, Miloud Mihoubi:
Note on chromatic polynomials of the threshold graphs. 217-224 - S. Arockiaraj, R. Gurusamy, KM. Kathiresan
On the Steiner antipodal number of graphs. 225-233 - John Fahnenstiel, Dalibor Froncek:
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges. 235-250 - Debi Oktia Haryeni
A method to construct graphs with certain partition dimension. 251-263 - Muhammad Ajmal, Masood Ur Rehman, Tayyab Kamran:
The second least eigenvalue of the signless Laplacian of the complements of trees. 265-275 - Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, II. 277-299 - Ravindra B. Bapat:
Squared distance matrix of a weighted tree. 301-313 - Hilal A. Ganie
Bounds for graph energy in terms of vertex covering and clique numbers. 315-328 - Olga O'Mahony, Rachel Quinlan:
Exponent-critical primitive graphs and the Kronecker product. 329-347 - Christian Barrientos, Sarah M. Minion:
Counting and labeling grid related graphs. 349-363 - Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai
Harary index of bipartite graphs. 365-372 - Wai Chee Shiu, Richard M. Low:
Orthogonal embeddings of graphs in Euclidean space. 373-381 - A. D. Forbes, Terry S. Griggs, K. A. Forbes:
Designs for graphs with six vertices and ten edges. 383-410 - Irene Heinrich
Cycle decompositions and constructive characterizations. 411-428
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-09 19:20 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: