New Infinite Families of 2-Edge Graphs
Loading...
Date
2014
Authors
Çalışkan, Cafer
Chee, Yeow Meng
Journal Title
Journal ISSN
Volume Title
Publisher
Wiley-Blackwell
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
A graph G of order n is called t-edge-balanced if G satisfies the property that there exists a positive for which every graph of order n and size t is contained in exactly distinct subgraphs of Kn isomorphic to G. We call the index of G. In this article we obtain new infinite families of 2-edge-balanced graphs.
Description
Keywords
Graphical t-designs, T-edge-balanced graphs, T-edge-balanced graphs, Graphical t-designs, \(t\)-edge-balanced graphs, Graph designs and isomorphic decomposition, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), Structural characterization of families of graphs, graphical \(t\)-design
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q2
OpenCitations Citation Count
1
Source
Journal of Combinatorial Designs
Volume
22
Issue
7
Start Page
291
End Page
305
PlumX Metrics
Citations
CrossRef : 1
Scopus : 1
Captures
Mendeley Readers : 3
SCOPUS™ Citations
1
checked on Feb 11, 2026
Web of Science™ Citations
1
checked on Feb 11, 2026
Page Views
6
checked on Feb 11, 2026
Downloads
135
checked on Feb 11, 2026
Google Scholar™
